/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:51:18,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:51:18,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:51:18,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:51:18,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:51:18,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:51:18,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:51:18,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:51:18,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:51:18,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:51:18,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:51:18,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:51:18,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:51:18,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:51:18,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:51:18,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:51:18,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:51:18,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:51:18,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:51:18,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:51:18,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:51:18,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:51:18,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:51:18,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:51:18,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:51:18,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:51:18,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:51:18,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:51:18,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:51:18,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:51:18,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:51:18,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:51:18,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:51:18,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:51:18,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:51:18,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:51:18,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:51:18,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:51:18,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:51:18,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:51:18,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:51:18,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:51:18,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:51:18,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:51:18,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:51:18,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:51:18,870 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:51:18,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:51:18,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:51:18,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:51:18,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:51:18,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:51:18,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:51:18,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:51:18,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:51:18,872 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:51:18,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:51:18,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:51:18,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:51:18,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:51:18,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:51:18,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:51:18,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:51:18,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:51:18,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:51:18,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:51:18,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:51:18,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:51:18,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:51:18,881 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:51:18,881 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:51:18,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:51:18,882 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:51:18,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:51:19,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:51:19,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:51:19,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:51:19,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:51:19,183 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:51:19,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_rmo.opt.i [2019-12-27 22:51:19,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1ae7aba/a10fa9cb3e9f434388c7fedb29ccfecd/FLAG51bf123a1 [2019-12-27 22:51:19,814 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:51:19,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_rmo.opt.i [2019-12-27 22:51:19,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1ae7aba/a10fa9cb3e9f434388c7fedb29ccfecd/FLAG51bf123a1 [2019-12-27 22:51:20,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1ae7aba/a10fa9cb3e9f434388c7fedb29ccfecd [2019-12-27 22:51:20,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:51:20,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:51:20,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:51:20,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:51:20,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:51:20,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:20,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20, skipping insertion in model container [2019-12-27 22:51:20,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:20,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:51:20,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:51:20,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:51:20,756 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:51:20,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:51:20,911 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:51:20,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20 WrapperNode [2019-12-27 22:51:20,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:51:20,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:51:20,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:51:20,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:51:20,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:20,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:20,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:51:20,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:51:20,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:51:20,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:51:20,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:20,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:20,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:20,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:21,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:21,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:21,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... [2019-12-27 22:51:21,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:51:21,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:51:21,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:51:21,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:51:21,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:51:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:51:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:51:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:51:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:51:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:51:21,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:51:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:51:21,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:51:21,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:51:21,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:51:21,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:51:21,125 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:51:22,062 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:51:22,062 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:51:22,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:51:22 BoogieIcfgContainer [2019-12-27 22:51:22,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:51:22,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:51:22,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:51:22,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:51:22,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:51:20" (1/3) ... [2019-12-27 22:51:22,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f1df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:51:22, skipping insertion in model container [2019-12-27 22:51:22,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:51:20" (2/3) ... [2019-12-27 22:51:22,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f1df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:51:22, skipping insertion in model container [2019-12-27 22:51:22,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:51:22" (3/3) ... [2019-12-27 22:51:22,073 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_rmo.opt.i [2019-12-27 22:51:22,084 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:51:22,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:51:22,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:51:22,097 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:51:22,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,175 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,175 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,221 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,221 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,224 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,225 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,230 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,232 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:51:22,256 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:51:22,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:51:22,276 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:51:22,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:51:22,276 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:51:22,276 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:51:22,276 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:51:22,276 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:51:22,276 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:51:22,291 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 22:51:22,293 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:51:22,399 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:51:22,399 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:51:22,416 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:51:22,444 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:51:22,498 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:51:22,498 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:51:22,507 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:51:22,528 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 22:51:22,530 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:51:25,784 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 22:51:26,117 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 22:51:26,267 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 22:51:26,296 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81281 [2019-12-27 22:51:26,296 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 22:51:26,300 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 22:51:45,068 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 22:51:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 22:51:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:51:45,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:51:45,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:51:45,080 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:51:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:51:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash 907029, now seen corresponding path program 1 times [2019-12-27 22:51:45,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:51:45,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068419459] [2019-12-27 22:51:45,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:51:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:51:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:51:45,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068419459] [2019-12-27 22:51:45,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:51:45,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:51:45,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253320408] [2019-12-27 22:51:45,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:51:45,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:51:45,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:51:45,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:51:45,345 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:51:45,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:51:45,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:51:45,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:51:45,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:51:45,363 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 22:51:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:51:46,366 INFO L93 Difference]: Finished difference Result 118789 states and 505722 transitions. [2019-12-27 22:51:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:51:46,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:51:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:51:50,080 INFO L225 Difference]: With dead ends: 118789 [2019-12-27 22:51:50,080 INFO L226 Difference]: Without dead ends: 111860 [2019-12-27 22:51:50,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:51:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111860 states. [2019-12-27 22:51:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111860 to 111860. [2019-12-27 22:51:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111860 states. [2019-12-27 22:51:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111860 states to 111860 states and 475614 transitions. [2019-12-27 22:51:57,314 INFO L78 Accepts]: Start accepts. Automaton has 111860 states and 475614 transitions. Word has length 3 [2019-12-27 22:51:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:51:57,314 INFO L462 AbstractCegarLoop]: Abstraction has 111860 states and 475614 transitions. [2019-12-27 22:51:57,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:51:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 111860 states and 475614 transitions. [2019-12-27 22:51:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:51:57,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:51:57,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:51:57,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:51:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:51:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash -559239811, now seen corresponding path program 1 times [2019-12-27 22:51:57,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:51:57,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307413339] [2019-12-27 22:51:57,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:51:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:51:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:51:57,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307413339] [2019-12-27 22:51:57,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:51:57,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:51:57,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1408102059] [2019-12-27 22:51:57,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:51:57,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:51:57,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:51:57,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:51:57,476 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:51:57,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:51:57,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:51:57,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:51:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:51:57,478 INFO L87 Difference]: Start difference. First operand 111860 states and 475614 transitions. Second operand 4 states. [2019-12-27 22:52:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:02,948 INFO L93 Difference]: Finished difference Result 177255 states and 718849 transitions. [2019-12-27 22:52:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:52:02,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:52:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:03,829 INFO L225 Difference]: With dead ends: 177255 [2019-12-27 22:52:03,829 INFO L226 Difference]: Without dead ends: 177206 [2019-12-27 22:52:03,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:52:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177206 states. [2019-12-27 22:52:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177206 to 161396. [2019-12-27 22:52:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161396 states. [2019-12-27 22:52:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161396 states to 161396 states and 663889 transitions. [2019-12-27 22:52:22,899 INFO L78 Accepts]: Start accepts. Automaton has 161396 states and 663889 transitions. Word has length 11 [2019-12-27 22:52:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:22,900 INFO L462 AbstractCegarLoop]: Abstraction has 161396 states and 663889 transitions. [2019-12-27 22:52:22,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:52:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 161396 states and 663889 transitions. [2019-12-27 22:52:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:52:22,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:22,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:22,907 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash 66814097, now seen corresponding path program 1 times [2019-12-27 22:52:22,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:22,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986912997] [2019-12-27 22:52:22,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:23,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986912997] [2019-12-27 22:52:23,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:23,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:52:23,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [720783570] [2019-12-27 22:52:23,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:23,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:23,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:52:23,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:23,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:23,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:52:23,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:23,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:52:23,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:52:23,013 INFO L87 Difference]: Start difference. First operand 161396 states and 663889 transitions. Second operand 4 states. [2019-12-27 22:52:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:23,253 INFO L93 Difference]: Finished difference Result 46583 states and 158739 transitions. [2019-12-27 22:52:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:52:23,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:52:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:23,318 INFO L225 Difference]: With dead ends: 46583 [2019-12-27 22:52:23,318 INFO L226 Difference]: Without dead ends: 35656 [2019-12-27 22:52:23,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:52:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35656 states. [2019-12-27 22:52:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35656 to 35560. [2019-12-27 22:52:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35560 states. [2019-12-27 22:52:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35560 states to 35560 states and 115084 transitions. [2019-12-27 22:52:23,984 INFO L78 Accepts]: Start accepts. Automaton has 35560 states and 115084 transitions. Word has length 13 [2019-12-27 22:52:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:23,985 INFO L462 AbstractCegarLoop]: Abstraction has 35560 states and 115084 transitions. [2019-12-27 22:52:23,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:52:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35560 states and 115084 transitions. [2019-12-27 22:52:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 22:52:23,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:23,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:23,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:23,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:23,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1749760644, now seen corresponding path program 1 times [2019-12-27 22:52:23,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:23,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940477205] [2019-12-27 22:52:23,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:24,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940477205] [2019-12-27 22:52:24,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:24,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:52:24,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2012705303] [2019-12-27 22:52:24,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:24,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:24,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 22:52:24,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:24,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:24,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:52:24,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:52:24,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:52:24,116 INFO L87 Difference]: Start difference. First operand 35560 states and 115084 transitions. Second operand 5 states. [2019-12-27 22:52:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:24,674 INFO L93 Difference]: Finished difference Result 47008 states and 150195 transitions. [2019-12-27 22:52:24,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:52:24,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 22:52:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:24,748 INFO L225 Difference]: With dead ends: 47008 [2019-12-27 22:52:24,748 INFO L226 Difference]: Without dead ends: 47008 [2019-12-27 22:52:24,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:52:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47008 states. [2019-12-27 22:52:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47008 to 40103. [2019-12-27 22:52:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40103 states. [2019-12-27 22:52:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40103 states to 40103 states and 129199 transitions. [2019-12-27 22:52:26,520 INFO L78 Accepts]: Start accepts. Automaton has 40103 states and 129199 transitions. Word has length 16 [2019-12-27 22:52:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:26,520 INFO L462 AbstractCegarLoop]: Abstraction has 40103 states and 129199 transitions. [2019-12-27 22:52:26,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:52:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 40103 states and 129199 transitions. [2019-12-27 22:52:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:52:26,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:26,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:26,531 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash 77153860, now seen corresponding path program 1 times [2019-12-27 22:52:26,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:26,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367043577] [2019-12-27 22:52:26,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:26,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-27 22:52:26,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367043577] [2019-12-27 22:52:26,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:26,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:52:26,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158777131] [2019-12-27 22:52:26,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:26,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:26,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 22:52:26,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:26,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:26,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:52:26,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:52:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:52:26,733 INFO L87 Difference]: Start difference. First operand 40103 states and 129199 transitions. Second operand 6 states. [2019-12-27 22:52:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:27,703 INFO L93 Difference]: Finished difference Result 60208 states and 188447 transitions. [2019-12-27 22:52:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:52:27,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:52:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:27,795 INFO L225 Difference]: With dead ends: 60208 [2019-12-27 22:52:27,795 INFO L226 Difference]: Without dead ends: 60152 [2019-12-27 22:52:27,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:52:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60152 states. [2019-12-27 22:52:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60152 to 40416. [2019-12-27 22:52:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40416 states. [2019-12-27 22:52:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40416 states to 40416 states and 129270 transitions. [2019-12-27 22:52:28,557 INFO L78 Accepts]: Start accepts. Automaton has 40416 states and 129270 transitions. Word has length 22 [2019-12-27 22:52:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:28,558 INFO L462 AbstractCegarLoop]: Abstraction has 40416 states and 129270 transitions. [2019-12-27 22:52:28,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:52:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 40416 states and 129270 transitions. [2019-12-27 22:52:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:52:28,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:28,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:28,573 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:28,573 INFO L82 PathProgramCache]: Analyzing trace with hash -99865394, now seen corresponding path program 1 times [2019-12-27 22:52:28,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:28,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778619444] [2019-12-27 22:52:28,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:28,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778619444] [2019-12-27 22:52:28,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:28,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:52:28,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995763186] [2019-12-27 22:52:28,656 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:28,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:28,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:52:28,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:28,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:52:28,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:52:28,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:52:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:52:28,718 INFO L87 Difference]: Start difference. First operand 40416 states and 129270 transitions. Second operand 6 states. [2019-12-27 22:52:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:28,900 INFO L93 Difference]: Finished difference Result 18314 states and 55351 transitions. [2019-12-27 22:52:28,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:52:28,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:52:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:28,930 INFO L225 Difference]: With dead ends: 18314 [2019-12-27 22:52:28,931 INFO L226 Difference]: Without dead ends: 15968 [2019-12-27 22:52:28,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:52:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15968 states. [2019-12-27 22:52:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15968 to 15639. [2019-12-27 22:52:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15639 states. [2019-12-27 22:52:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15639 states to 15639 states and 47246 transitions. [2019-12-27 22:52:29,168 INFO L78 Accepts]: Start accepts. Automaton has 15639 states and 47246 transitions. Word has length 25 [2019-12-27 22:52:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:29,168 INFO L462 AbstractCegarLoop]: Abstraction has 15639 states and 47246 transitions. [2019-12-27 22:52:29,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:52:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 15639 states and 47246 transitions. [2019-12-27 22:52:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 22:52:29,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:29,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:29,184 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1405741723, now seen corresponding path program 1 times [2019-12-27 22:52:29,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:29,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869404393] [2019-12-27 22:52:29,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:29,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869404393] [2019-12-27 22:52:29,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:29,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:52:29,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915225336] [2019-12-27 22:52:29,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:29,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:29,304 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 22:52:29,304 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:29,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:29,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:52:29,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:52:29,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:52:29,306 INFO L87 Difference]: Start difference. First operand 15639 states and 47246 transitions. Second operand 6 states. [2019-12-27 22:52:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:30,123 INFO L93 Difference]: Finished difference Result 22139 states and 65014 transitions. [2019-12-27 22:52:30,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:52:30,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 22:52:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:30,151 INFO L225 Difference]: With dead ends: 22139 [2019-12-27 22:52:30,151 INFO L226 Difference]: Without dead ends: 21829 [2019-12-27 22:52:30,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:52:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21829 states. [2019-12-27 22:52:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21829 to 17672. [2019-12-27 22:52:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-12-27 22:52:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 52928 transitions. [2019-12-27 22:52:30,402 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 52928 transitions. Word has length 27 [2019-12-27 22:52:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:30,402 INFO L462 AbstractCegarLoop]: Abstraction has 17672 states and 52928 transitions. [2019-12-27 22:52:30,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:52:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 52928 transitions. [2019-12-27 22:52:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 22:52:30,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:30,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:30,420 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1695782975, now seen corresponding path program 1 times [2019-12-27 22:52:30,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:30,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945436102] [2019-12-27 22:52:30,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:30,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945436102] [2019-12-27 22:52:30,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:30,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:52:30,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329524656] [2019-12-27 22:52:30,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:30,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:30,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 63 transitions. [2019-12-27 22:52:30,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:30,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:30,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:52:30,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:52:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:52:30,561 INFO L87 Difference]: Start difference. First operand 17672 states and 52928 transitions. Second operand 7 states. [2019-12-27 22:52:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:31,721 INFO L93 Difference]: Finished difference Result 24510 states and 71503 transitions. [2019-12-27 22:52:31,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:52:31,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 22:52:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:31,755 INFO L225 Difference]: With dead ends: 24510 [2019-12-27 22:52:31,755 INFO L226 Difference]: Without dead ends: 23823 [2019-12-27 22:52:31,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:52:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23823 states. [2019-12-27 22:52:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23823 to 16410. [2019-12-27 22:52:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16410 states. [2019-12-27 22:52:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16410 states to 16410 states and 49104 transitions. [2019-12-27 22:52:32,039 INFO L78 Accepts]: Start accepts. Automaton has 16410 states and 49104 transitions. Word has length 33 [2019-12-27 22:52:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:32,040 INFO L462 AbstractCegarLoop]: Abstraction has 16410 states and 49104 transitions. [2019-12-27 22:52:32,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:52:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16410 states and 49104 transitions. [2019-12-27 22:52:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:52:32,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:32,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:32,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1887576244, now seen corresponding path program 1 times [2019-12-27 22:52:32,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:32,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557152809] [2019-12-27 22:52:32,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:32,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557152809] [2019-12-27 22:52:32,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:32,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:52:32,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971524403] [2019-12-27 22:52:32,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:32,138 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:32,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 22:52:32,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:32,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:32,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:52:32,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:52:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:52:32,218 INFO L87 Difference]: Start difference. First operand 16410 states and 49104 transitions. Second operand 3 states. [2019-12-27 22:52:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:32,310 INFO L93 Difference]: Finished difference Result 16409 states and 49102 transitions. [2019-12-27 22:52:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:52:32,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:52:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:32,346 INFO L225 Difference]: With dead ends: 16409 [2019-12-27 22:52:32,346 INFO L226 Difference]: Without dead ends: 16409 [2019-12-27 22:52:32,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:52:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16409 states. [2019-12-27 22:52:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16409 to 16409. [2019-12-27 22:52:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16409 states. [2019-12-27 22:52:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16409 states to 16409 states and 49102 transitions. [2019-12-27 22:52:32,724 INFO L78 Accepts]: Start accepts. Automaton has 16409 states and 49102 transitions. Word has length 39 [2019-12-27 22:52:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:32,724 INFO L462 AbstractCegarLoop]: Abstraction has 16409 states and 49102 transitions. [2019-12-27 22:52:32,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:52:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 16409 states and 49102 transitions. [2019-12-27 22:52:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:52:32,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:32,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:32,756 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1039609235, now seen corresponding path program 1 times [2019-12-27 22:52:32,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:32,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85270822] [2019-12-27 22:52:32,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:32,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85270822] [2019-12-27 22:52:32,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:32,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:52:32,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837235822] [2019-12-27 22:52:32,837 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:32,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:32,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 324 transitions. [2019-12-27 22:52:32,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:33,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:52:33,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:52:33,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:52:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:52:33,003 INFO L87 Difference]: Start difference. First operand 16409 states and 49102 transitions. Second operand 8 states. [2019-12-27 22:52:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:34,113 INFO L93 Difference]: Finished difference Result 23552 states and 70064 transitions. [2019-12-27 22:52:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:52:34,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 22:52:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:34,147 INFO L225 Difference]: With dead ends: 23552 [2019-12-27 22:52:34,147 INFO L226 Difference]: Without dead ends: 23552 [2019-12-27 22:52:34,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:52:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23552 states. [2019-12-27 22:52:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23552 to 21952. [2019-12-27 22:52:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21952 states. [2019-12-27 22:52:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21952 states to 21952 states and 65694 transitions. [2019-12-27 22:52:34,628 INFO L78 Accepts]: Start accepts. Automaton has 21952 states and 65694 transitions. Word has length 40 [2019-12-27 22:52:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:34,629 INFO L462 AbstractCegarLoop]: Abstraction has 21952 states and 65694 transitions. [2019-12-27 22:52:34,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:52:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 21952 states and 65694 transitions. [2019-12-27 22:52:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:52:34,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:34,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:34,657 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash -569045237, now seen corresponding path program 2 times [2019-12-27 22:52:34,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:34,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761904830] [2019-12-27 22:52:34,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:34,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761904830] [2019-12-27 22:52:34,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:34,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:52:34,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5735331] [2019-12-27 22:52:34,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:34,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:34,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 450 transitions. [2019-12-27 22:52:34,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:35,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:52:35,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:52:35,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:35,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:52:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:52:35,019 INFO L87 Difference]: Start difference. First operand 21952 states and 65694 transitions. Second operand 9 states. [2019-12-27 22:52:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:37,030 INFO L93 Difference]: Finished difference Result 30463 states and 89852 transitions. [2019-12-27 22:52:37,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:52:37,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 22:52:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:37,073 INFO L225 Difference]: With dead ends: 30463 [2019-12-27 22:52:37,073 INFO L226 Difference]: Without dead ends: 30463 [2019-12-27 22:52:37,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:52:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30463 states. [2019-12-27 22:52:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30463 to 23594. [2019-12-27 22:52:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23594 states. [2019-12-27 22:52:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23594 states to 23594 states and 70676 transitions. [2019-12-27 22:52:37,463 INFO L78 Accepts]: Start accepts. Automaton has 23594 states and 70676 transitions. Word has length 40 [2019-12-27 22:52:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:37,464 INFO L462 AbstractCegarLoop]: Abstraction has 23594 states and 70676 transitions. [2019-12-27 22:52:37,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:52:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 23594 states and 70676 transitions. [2019-12-27 22:52:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:52:37,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:37,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:37,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -281396461, now seen corresponding path program 3 times [2019-12-27 22:52:37,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:37,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268222755] [2019-12-27 22:52:37,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:37,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268222755] [2019-12-27 22:52:37,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:37,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:52:37,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123008248] [2019-12-27 22:52:37,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:37,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:37,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 441 transitions. [2019-12-27 22:52:37,695 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:37,835 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:52:37,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:52:37,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:52:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:52:37,837 INFO L87 Difference]: Start difference. First operand 23594 states and 70676 transitions. Second operand 12 states. [2019-12-27 22:52:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:41,084 INFO L93 Difference]: Finished difference Result 68005 states and 202219 transitions. [2019-12-27 22:52:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:52:41,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 22:52:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:41,438 INFO L225 Difference]: With dead ends: 68005 [2019-12-27 22:52:41,438 INFO L226 Difference]: Without dead ends: 68005 [2019-12-27 22:52:41,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:52:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68005 states. [2019-12-27 22:52:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68005 to 26903. [2019-12-27 22:52:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26903 states. [2019-12-27 22:52:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26903 states to 26903 states and 81265 transitions. [2019-12-27 22:52:42,062 INFO L78 Accepts]: Start accepts. Automaton has 26903 states and 81265 transitions. Word has length 40 [2019-12-27 22:52:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:42,062 INFO L462 AbstractCegarLoop]: Abstraction has 26903 states and 81265 transitions. [2019-12-27 22:52:42,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:52:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 26903 states and 81265 transitions. [2019-12-27 22:52:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:52:42,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:42,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:42,099 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1250676141, now seen corresponding path program 4 times [2019-12-27 22:52:42,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:42,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564715893] [2019-12-27 22:52:42,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:42,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564715893] [2019-12-27 22:52:42,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:42,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:52:42,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271644315] [2019-12-27 22:52:42,152 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:42,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:42,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 22:52:42,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:42,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:52:42,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:52:42,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:42,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:52:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:52:42,264 INFO L87 Difference]: Start difference. First operand 26903 states and 81265 transitions. Second operand 4 states. [2019-12-27 22:52:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:42,572 INFO L93 Difference]: Finished difference Result 33687 states and 98656 transitions. [2019-12-27 22:52:42,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:52:42,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:52:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:42,616 INFO L225 Difference]: With dead ends: 33687 [2019-12-27 22:52:42,616 INFO L226 Difference]: Without dead ends: 33687 [2019-12-27 22:52:42,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:52:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33687 states. [2019-12-27 22:52:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33687 to 23586. [2019-12-27 22:52:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23586 states. [2019-12-27 22:52:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23586 states to 23586 states and 69972 transitions. [2019-12-27 22:52:42,992 INFO L78 Accepts]: Start accepts. Automaton has 23586 states and 69972 transitions. Word has length 40 [2019-12-27 22:52:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:42,992 INFO L462 AbstractCegarLoop]: Abstraction has 23586 states and 69972 transitions. [2019-12-27 22:52:42,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:52:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23586 states and 69972 transitions. [2019-12-27 22:52:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:52:43,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:43,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:43,023 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1866373660, now seen corresponding path program 1 times [2019-12-27 22:52:43,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:43,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492006959] [2019-12-27 22:52:43,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:43,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492006959] [2019-12-27 22:52:43,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:43,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:52:43,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505822672] [2019-12-27 22:52:43,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:43,128 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:43,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 206 transitions. [2019-12-27 22:52:43,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:43,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:43,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:52:43,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:43,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:52:43,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:52:43,179 INFO L87 Difference]: Start difference. First operand 23586 states and 69972 transitions. Second operand 6 states. [2019-12-27 22:52:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:43,359 INFO L93 Difference]: Finished difference Result 22438 states and 67293 transitions. [2019-12-27 22:52:43,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:52:43,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 22:52:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:43,397 INFO L225 Difference]: With dead ends: 22438 [2019-12-27 22:52:43,398 INFO L226 Difference]: Without dead ends: 22243 [2019-12-27 22:52:43,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:52:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22243 states. [2019-12-27 22:52:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22243 to 21438. [2019-12-27 22:52:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21438 states. [2019-12-27 22:52:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21438 states to 21438 states and 64712 transitions. [2019-12-27 22:52:43,741 INFO L78 Accepts]: Start accepts. Automaton has 21438 states and 64712 transitions. Word has length 41 [2019-12-27 22:52:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:43,741 INFO L462 AbstractCegarLoop]: Abstraction has 21438 states and 64712 transitions. [2019-12-27 22:52:43,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:52:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21438 states and 64712 transitions. [2019-12-27 22:52:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:52:43,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:43,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] [2019-12-27 22:52:43,764 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1793843893, now seen corresponding path program 1 times [2019-12-27 22:52:43,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:43,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050749846] [2019-12-27 22:52:43,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:43,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050749846] [2019-12-27 22:52:43,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:43,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:52:43,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027058815] [2019-12-27 22:52:43,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:43,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:44,233 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 408 transitions. [2019-12-27 22:52:44,233 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:44,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:44,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:52:44,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:44,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:52:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:52:44,235 INFO L87 Difference]: Start difference. First operand 21438 states and 64712 transitions. Second operand 3 states. [2019-12-27 22:52:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:44,427 INFO L93 Difference]: Finished difference Result 32022 states and 96710 transitions. [2019-12-27 22:52:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:52:44,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:52:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:44,491 INFO L225 Difference]: With dead ends: 32022 [2019-12-27 22:52:44,491 INFO L226 Difference]: Without dead ends: 32022 [2019-12-27 22:52:44,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:52:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32022 states. [2019-12-27 22:52:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32022 to 24227. [2019-12-27 22:52:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24227 states. [2019-12-27 22:52:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24227 states to 24227 states and 73894 transitions. [2019-12-27 22:52:44,962 INFO L78 Accepts]: Start accepts. Automaton has 24227 states and 73894 transitions. Word has length 65 [2019-12-27 22:52:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:44,962 INFO L462 AbstractCegarLoop]: Abstraction has 24227 states and 73894 transitions. [2019-12-27 22:52:44,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:52:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 24227 states and 73894 transitions. [2019-12-27 22:52:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:52:44,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:44,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:44,987 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2082486832, now seen corresponding path program 1 times [2019-12-27 22:52:44,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:44,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085239002] [2019-12-27 22:52:44,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:45,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085239002] [2019-12-27 22:52:45,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:45,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:52:45,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958095711] [2019-12-27 22:52:45,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:45,114 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:45,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 408 transitions. [2019-12-27 22:52:45,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:45,399 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:52:45,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:52:45,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:52:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:52:45,401 INFO L87 Difference]: Start difference. First operand 24227 states and 73894 transitions. Second operand 10 states. [2019-12-27 22:52:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:46,102 INFO L93 Difference]: Finished difference Result 73392 states and 221075 transitions. [2019-12-27 22:52:46,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:52:46,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:52:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:46,173 INFO L225 Difference]: With dead ends: 73392 [2019-12-27 22:52:46,173 INFO L226 Difference]: Without dead ends: 51486 [2019-12-27 22:52:46,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:52:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51486 states. [2019-12-27 22:52:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51486 to 28092. [2019-12-27 22:52:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28092 states. [2019-12-27 22:52:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28092 states to 28092 states and 85337 transitions. [2019-12-27 22:52:47,110 INFO L78 Accepts]: Start accepts. Automaton has 28092 states and 85337 transitions. Word has length 65 [2019-12-27 22:52:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:47,111 INFO L462 AbstractCegarLoop]: Abstraction has 28092 states and 85337 transitions. [2019-12-27 22:52:47,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:52:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28092 states and 85337 transitions. [2019-12-27 22:52:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:52:47,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:47,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:47,140 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1961212410, now seen corresponding path program 2 times [2019-12-27 22:52:47,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:47,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851690843] [2019-12-27 22:52:47,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:47,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851690843] [2019-12-27 22:52:47,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:47,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:52:47,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114118369] [2019-12-27 22:52:47,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:47,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:47,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 288 states and 589 transitions. [2019-12-27 22:52:47,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:47,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:52:47,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:52:47,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:52:47,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:52:47,506 INFO L87 Difference]: Start difference. First operand 28092 states and 85337 transitions. Second operand 5 states. [2019-12-27 22:52:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:47,849 INFO L93 Difference]: Finished difference Result 30211 states and 91225 transitions. [2019-12-27 22:52:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:52:47,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:52:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:47,889 INFO L225 Difference]: With dead ends: 30211 [2019-12-27 22:52:47,890 INFO L226 Difference]: Without dead ends: 30211 [2019-12-27 22:52:47,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:52:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30211 states. [2019-12-27 22:52:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30211 to 28430. [2019-12-27 22:52:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28430 states. [2019-12-27 22:52:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28430 states to 28430 states and 86341 transitions. [2019-12-27 22:52:48,307 INFO L78 Accepts]: Start accepts. Automaton has 28430 states and 86341 transitions. Word has length 65 [2019-12-27 22:52:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:48,307 INFO L462 AbstractCegarLoop]: Abstraction has 28430 states and 86341 transitions. [2019-12-27 22:52:48,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:52:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 28430 states and 86341 transitions. [2019-12-27 22:52:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:52:48,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:48,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:48,335 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:48,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:48,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1524127272, now seen corresponding path program 3 times [2019-12-27 22:52:48,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:48,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430995807] [2019-12-27 22:52:48,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:48,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430995807] [2019-12-27 22:52:48,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:48,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:52:48,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1657587511] [2019-12-27 22:52:48,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:48,500 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:48,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 475 transitions. [2019-12-27 22:52:48,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:48,790 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:52:48,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:52:48,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:52:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:52:48,791 INFO L87 Difference]: Start difference. First operand 28430 states and 86341 transitions. Second operand 10 states. [2019-12-27 22:52:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:50,289 INFO L93 Difference]: Finished difference Result 42138 states and 125593 transitions. [2019-12-27 22:52:50,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:52:50,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:52:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:50,348 INFO L225 Difference]: With dead ends: 42138 [2019-12-27 22:52:50,348 INFO L226 Difference]: Without dead ends: 42138 [2019-12-27 22:52:50,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:52:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42138 states. [2019-12-27 22:52:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42138 to 32009. [2019-12-27 22:52:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32009 states. [2019-12-27 22:52:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32009 states to 32009 states and 96521 transitions. [2019-12-27 22:52:50,843 INFO L78 Accepts]: Start accepts. Automaton has 32009 states and 96521 transitions. Word has length 65 [2019-12-27 22:52:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:50,844 INFO L462 AbstractCegarLoop]: Abstraction has 32009 states and 96521 transitions. [2019-12-27 22:52:50,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:52:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 32009 states and 96521 transitions. [2019-12-27 22:52:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:52:50,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:50,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:50,877 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1989671644, now seen corresponding path program 4 times [2019-12-27 22:52:50,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:50,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600972494] [2019-12-27 22:52:50,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:50,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600972494] [2019-12-27 22:52:50,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:50,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:52:50,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1736817254] [2019-12-27 22:52:50,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:50,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:51,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 441 transitions. [2019-12-27 22:52:51,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:51,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:52:51,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:52:51,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:51,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:52:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:52:51,270 INFO L87 Difference]: Start difference. First operand 32009 states and 96521 transitions. Second operand 3 states. [2019-12-27 22:52:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:51,463 INFO L93 Difference]: Finished difference Result 32008 states and 96519 transitions. [2019-12-27 22:52:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:52:51,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:52:51,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:51,539 INFO L225 Difference]: With dead ends: 32008 [2019-12-27 22:52:51,539 INFO L226 Difference]: Without dead ends: 32008 [2019-12-27 22:52:51,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:52:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32008 states. [2019-12-27 22:52:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32008 to 26073. [2019-12-27 22:52:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26073 states. [2019-12-27 22:52:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26073 states to 26073 states and 79831 transitions. [2019-12-27 22:52:52,178 INFO L78 Accepts]: Start accepts. Automaton has 26073 states and 79831 transitions. Word has length 65 [2019-12-27 22:52:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:52:52,178 INFO L462 AbstractCegarLoop]: Abstraction has 26073 states and 79831 transitions. [2019-12-27 22:52:52,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:52:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 26073 states and 79831 transitions. [2019-12-27 22:52:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:52:52,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:52:52,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:52:52,206 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:52:52,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:52:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1004204331, now seen corresponding path program 1 times [2019-12-27 22:52:52,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:52:52,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946187208] [2019-12-27 22:52:52,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:52:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:52:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:52:52,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946187208] [2019-12-27 22:52:52,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:52:52,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:52:52,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734521347] [2019-12-27 22:52:52,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:52:52,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:52:53,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 289 states and 590 transitions. [2019-12-27 22:52:53,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:52:53,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:52:53,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:52:53,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:52:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:52:53,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:52:53,250 INFO L87 Difference]: Start difference. First operand 26073 states and 79831 transitions. Second operand 16 states. [2019-12-27 22:52:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:52:59,569 INFO L93 Difference]: Finished difference Result 105298 states and 322655 transitions. [2019-12-27 22:52:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 22:52:59,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 22:52:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:52:59,702 INFO L225 Difference]: With dead ends: 105298 [2019-12-27 22:52:59,702 INFO L226 Difference]: Without dead ends: 90205 [2019-12-27 22:52:59,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1035, Invalid=5445, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 22:52:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90205 states. [2019-12-27 22:53:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90205 to 35897. [2019-12-27 22:53:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35897 states. [2019-12-27 22:53:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35897 states to 35897 states and 109891 transitions. [2019-12-27 22:53:01,134 INFO L78 Accepts]: Start accepts. Automaton has 35897 states and 109891 transitions. Word has length 66 [2019-12-27 22:53:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:53:01,134 INFO L462 AbstractCegarLoop]: Abstraction has 35897 states and 109891 transitions. [2019-12-27 22:53:01,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:53:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 35897 states and 109891 transitions. [2019-12-27 22:53:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:53:01,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:53:01,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:53:01,174 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:53:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:53:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 34506845, now seen corresponding path program 2 times [2019-12-27 22:53:01,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:53:01,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809260768] [2019-12-27 22:53:01,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:53:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:53:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:53:01,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809260768] [2019-12-27 22:53:01,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:53:01,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:53:01,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963892046] [2019-12-27 22:53:01,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:53:01,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:53:01,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 626 transitions. [2019-12-27 22:53:01,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:53:01,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 22:53:01,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:53:01,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:53:01,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:53:01,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:53:01,915 INFO L87 Difference]: Start difference. First operand 35897 states and 109891 transitions. Second operand 17 states. [2019-12-27 22:53:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:53:08,868 INFO L93 Difference]: Finished difference Result 134948 states and 409781 transitions. [2019-12-27 22:53:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-27 22:53:08,869 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 22:53:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:53:09,012 INFO L225 Difference]: With dead ends: 134948 [2019-12-27 22:53:09,013 INFO L226 Difference]: Without dead ends: 85128 [2019-12-27 22:53:09,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3971 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1571, Invalid=9559, Unknown=0, NotChecked=0, Total=11130 [2019-12-27 22:53:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85128 states. [2019-12-27 22:53:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85128 to 29388. [2019-12-27 22:53:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29388 states. [2019-12-27 22:53:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29388 states to 29388 states and 89223 transitions. [2019-12-27 22:53:10,237 INFO L78 Accepts]: Start accepts. Automaton has 29388 states and 89223 transitions. Word has length 66 [2019-12-27 22:53:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:53:10,237 INFO L462 AbstractCegarLoop]: Abstraction has 29388 states and 89223 transitions. [2019-12-27 22:53:10,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:53:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 29388 states and 89223 transitions. [2019-12-27 22:53:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:53:10,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:53:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:53:10,272 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:53:10,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:53:10,273 INFO L82 PathProgramCache]: Analyzing trace with hash -753512063, now seen corresponding path program 3 times [2019-12-27 22:53:10,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:53:10,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639779832] [2019-12-27 22:53:10,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:53:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:53:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:53:10,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639779832] [2019-12-27 22:53:10,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:53:10,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 22:53:10,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47724127] [2019-12-27 22:53:10,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:53:10,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:53:11,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 326 states and 666 transitions. [2019-12-27 22:53:11,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:53:11,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:53:12,673 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 22:53:12,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:53:13,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 57 times. [2019-12-27 22:53:13,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 22:53:13,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:53:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 22:53:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:53:13,091 INFO L87 Difference]: Start difference. First operand 29388 states and 89223 transitions. Second operand 34 states. [2019-12-27 22:53:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:53:26,145 INFO L93 Difference]: Finished difference Result 47130 states and 141060 transitions. [2019-12-27 22:53:26,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 22:53:26,145 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-12-27 22:53:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:53:26,207 INFO L225 Difference]: With dead ends: 47130 [2019-12-27 22:53:26,207 INFO L226 Difference]: Without dead ends: 44043 [2019-12-27 22:53:26,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 16 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=608, Invalid=3424, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 22:53:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44043 states. [2019-12-27 22:53:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44043 to 29692. [2019-12-27 22:53:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29692 states. [2019-12-27 22:53:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29692 states to 29692 states and 90391 transitions. [2019-12-27 22:53:26,721 INFO L78 Accepts]: Start accepts. Automaton has 29692 states and 90391 transitions. Word has length 66 [2019-12-27 22:53:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:53:26,721 INFO L462 AbstractCegarLoop]: Abstraction has 29692 states and 90391 transitions. [2019-12-27 22:53:26,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 22:53:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 29692 states and 90391 transitions. [2019-12-27 22:53:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:53:26,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:53:26,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:53:26,753 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:53:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:53:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1903545705, now seen corresponding path program 4 times [2019-12-27 22:53:26,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:53:26,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762149082] [2019-12-27 22:53:26,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:53:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:53:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:53:26,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762149082] [2019-12-27 22:53:26,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:53:26,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:53:26,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1968353378] [2019-12-27 22:53:26,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:53:26,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:53:27,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 583 transitions. [2019-12-27 22:53:27,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:53:27,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 22:53:27,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:53:27,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:53:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:53:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:53:27,451 INFO L87 Difference]: Start difference. First operand 29692 states and 90391 transitions. Second operand 13 states. [2019-12-27 22:53:28,058 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 22:53:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:53:29,182 INFO L93 Difference]: Finished difference Result 44157 states and 133139 transitions. [2019-12-27 22:53:29,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:53:29,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 22:53:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:53:29,244 INFO L225 Difference]: With dead ends: 44157 [2019-12-27 22:53:29,244 INFO L226 Difference]: Without dead ends: 42885 [2019-12-27 22:53:29,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:53:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42885 states. [2019-12-27 22:53:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42885 to 29668. [2019-12-27 22:53:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29668 states. [2019-12-27 22:53:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29668 states to 29668 states and 90325 transitions. [2019-12-27 22:53:29,757 INFO L78 Accepts]: Start accepts. Automaton has 29668 states and 90325 transitions. Word has length 66 [2019-12-27 22:53:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:53:29,757 INFO L462 AbstractCegarLoop]: Abstraction has 29668 states and 90325 transitions. [2019-12-27 22:53:29,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:53:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 29668 states and 90325 transitions. [2019-12-27 22:53:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:53:29,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:53:29,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:53:29,788 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:53:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:53:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash 643280457, now seen corresponding path program 5 times [2019-12-27 22:53:29,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:53:29,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038118057] [2019-12-27 22:53:29,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:53:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:53:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:53:29,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038118057] [2019-12-27 22:53:29,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:53:29,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:53:29,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281917741] [2019-12-27 22:53:29,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:53:29,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:53:30,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 323 transitions. [2019-12-27 22:53:30,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:53:30,054 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:53:30,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:53:30,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:53:30,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:53:30,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:53:30,055 INFO L87 Difference]: Start difference. First operand 29668 states and 90325 transitions. Second operand 4 states. [2019-12-27 22:53:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:53:30,212 INFO L93 Difference]: Finished difference Result 33916 states and 103022 transitions. [2019-12-27 22:53:30,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:53:30,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 22:53:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:53:30,256 INFO L225 Difference]: With dead ends: 33916 [2019-12-27 22:53:30,257 INFO L226 Difference]: Without dead ends: 33916 [2019-12-27 22:53:30,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:53:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33916 states. [2019-12-27 22:53:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33916 to 29722. [2019-12-27 22:53:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29722 states. [2019-12-27 22:53:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29722 states to 29722 states and 90743 transitions. [2019-12-27 22:53:30,718 INFO L78 Accepts]: Start accepts. Automaton has 29722 states and 90743 transitions. Word has length 66 [2019-12-27 22:53:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:53:30,718 INFO L462 AbstractCegarLoop]: Abstraction has 29722 states and 90743 transitions. [2019-12-27 22:53:30,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:53:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29722 states and 90743 transitions. [2019-12-27 22:53:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:53:30,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:53:30,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:53:30,749 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:53:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:53:30,750 INFO L82 PathProgramCache]: Analyzing trace with hash 299032321, now seen corresponding path program 1 times [2019-12-27 22:53:30,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:53:30,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340172096] [2019-12-27 22:53:30,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:53:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:53:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:53:30,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340172096] [2019-12-27 22:53:30,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:53:30,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:53:30,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630741692] [2019-12-27 22:53:30,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:53:30,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:53:31,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 381 transitions. [2019-12-27 22:53:31,155 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:53:31,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:53:31,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:53:31,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:53:31,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:53:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:53:31,197 INFO L87 Difference]: Start difference. First operand 29722 states and 90743 transitions. Second operand 4 states. [2019-12-27 22:53:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:53:31,742 INFO L93 Difference]: Finished difference Result 39564 states and 120674 transitions. [2019-12-27 22:53:31,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:53:31,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 22:53:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:53:31,817 INFO L225 Difference]: With dead ends: 39564 [2019-12-27 22:53:31,817 INFO L226 Difference]: Without dead ends: 39564 [2019-12-27 22:53:31,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:53:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39564 states. [2019-12-27 22:53:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39564 to 30119. [2019-12-27 22:53:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30119 states. [2019-12-27 22:53:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30119 states to 30119 states and 92017 transitions. [2019-12-27 22:53:32,362 INFO L78 Accepts]: Start accepts. Automaton has 30119 states and 92017 transitions. Word has length 67 [2019-12-27 22:53:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:53:32,362 INFO L462 AbstractCegarLoop]: Abstraction has 30119 states and 92017 transitions. [2019-12-27 22:53:32,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:53:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30119 states and 92017 transitions. [2019-12-27 22:53:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:53:32,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:53:32,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:53:32,393 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:53:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:53:32,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1852637963, now seen corresponding path program 2 times [2019-12-27 22:53:32,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:53:32,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546838669] [2019-12-27 22:53:32,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:53:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:53:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:53:32,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546838669] [2019-12-27 22:53:32,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:53:32,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:53:32,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712632454] [2019-12-27 22:53:32,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:53:32,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:53:32,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 456 transitions. [2019-12-27 22:53:32,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:53:32,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:53:32,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:53:32,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:53:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:53:32,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:53:32,891 INFO L87 Difference]: Start difference. First operand 30119 states and 92017 transitions. Second operand 9 states. [2019-12-27 22:53:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:53:34,046 INFO L93 Difference]: Finished difference Result 61098 states and 187160 transitions. [2019-12-27 22:53:34,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:53:34,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 22:53:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:53:34,138 INFO L225 Difference]: With dead ends: 61098 [2019-12-27 22:53:34,138 INFO L226 Difference]: Without dead ends: 61098 [2019-12-27 22:53:34,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:53:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61098 states. [2019-12-27 22:53:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61098 to 33196. [2019-12-27 22:53:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33196 states. [2019-12-27 22:53:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33196 states to 33196 states and 102304 transitions. [2019-12-27 22:53:34,882 INFO L78 Accepts]: Start accepts. Automaton has 33196 states and 102304 transitions. Word has length 67 [2019-12-27 22:53:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:53:34,882 INFO L462 AbstractCegarLoop]: Abstraction has 33196 states and 102304 transitions. [2019-12-27 22:53:34,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:53:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 33196 states and 102304 transitions. [2019-12-27 22:53:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:53:34,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:53:34,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:53:34,923 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:53:34,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:53:34,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1753967852, now seen corresponding path program 1 times [2019-12-27 22:53:34,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:53:34,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151752912] [2019-12-27 22:53:34,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:53:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:53:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:53:35,039 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:53:35,039 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:53:35,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= |v_ULTIMATE.start_main_~#t2408~0.offset_20| 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2408~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2408~0.base_27|) |v_ULTIMATE.start_main_~#t2408~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff1_thd0~0_23) (= 0 v_~y$w_buff1~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2408~0.base_27| 4)) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t2408~0.base_27| 1)) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~weak$$choice2~0_34) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$r_buff1_thd2~0_19) (= 0 v_~y$w_buff0~0_29) (= 0 v_~y$flush_delayed~0_13) (= v_~y~0_28 0) (= 0 v_~y$r_buff1_thd3~0_49) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2408~0.base_27|)) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_4|) (= v_~x~0_18 0) (= 0 v_~y$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2408~0.base_27|) (= 0 v_~y$r_buff1_thd1~0_19) (= v_~y$w_buff0_used~0_118 0) (= v_~y$r_buff0_thd3~0_78 0) (= |v_#NULL.offset_4| 0) (= v_~y$mem_tmp~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y$r_buff0_thd1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t2409~0.base=|v_ULTIMATE.start_main_~#t2409~0.base_25|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ULTIMATE.start_main_~#t2409~0.offset=|v_ULTIMATE.start_main_~#t2409~0.offset_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_24|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~y~0=v_~y~0_28, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_~#t2408~0.offset=|v_ULTIMATE.start_main_~#t2408~0.offset_20|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2408~0.base=|v_ULTIMATE.start_main_~#t2408~0.base_27|, ULTIMATE.start_main_~#t2410~0.base=|v_ULTIMATE.start_main_~#t2410~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t2410~0.offset=|v_ULTIMATE.start_main_~#t2410~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_60|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_23, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2409~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t2409~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2408~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2408~0.base, ULTIMATE.start_main_~#t2410~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2410~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:53:35,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L815-1-->L817: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2409~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2409~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2409~0.offset_10| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2409~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2409~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2409~0.base_11|) |v_ULTIMATE.start_main_~#t2409~0.offset_10| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2409~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2409~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2409~0.base=|v_ULTIMATE.start_main_~#t2409~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2409~0.offset=|v_ULTIMATE.start_main_~#t2409~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2409~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2409~0.offset, #length] because there is no mapped edge [2019-12-27 22:53:35,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_18 v_~y$w_buff1~0_15) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_85) (= 1 v_~y$w_buff0_used~0_84) (= 1 v_~y$w_buff0~0_17) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= (mod v_~y$w_buff1_used~0_53 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_53} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:53:35,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2410~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2410~0.base_11|) |v_ULTIMATE.start_main_~#t2410~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2410~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2410~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2410~0.base_11| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2410~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t2410~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2410~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2410~0.offset=|v_ULTIMATE.start_main_~#t2410~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2410~0.base=|v_ULTIMATE.start_main_~#t2410~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2410~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2410~0.base, #length] because there is no mapped edge [2019-12-27 22:53:35,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1917191408 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In-1917191408| |P2Thread1of1ForFork2_#t~ite23_Out-1917191408|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out-1917191408| ~y$w_buff1~0_In-1917191408)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out-1917191408| |P2Thread1of1ForFork2_#t~ite23_Out-1917191408|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1917191408 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1917191408 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1917191408 256))) (and (= 0 (mod ~y$r_buff1_thd3~0_In-1917191408 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite23_Out-1917191408| ~y$w_buff1~0_In-1917191408)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1917191408|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1917191408, ~y$w_buff1~0=~y$w_buff1~0_In-1917191408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917191408, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1917191408, ~weak$$choice2~0=~weak$$choice2~0_In-1917191408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917191408} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1917191408|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1917191408|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1917191408, ~y$w_buff1~0=~y$w_buff1~0_In-1917191408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917191408, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1917191408, ~weak$$choice2~0=~weak$$choice2~0_In-1917191408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917191408} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 22:53:35,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1220266935 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In1220266935| |P2Thread1of1ForFork2_#t~ite26_Out1220266935|) (= ~y$w_buff0_used~0_In1220266935 |P2Thread1of1ForFork2_#t~ite27_Out1220266935|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1220266935 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1220266935 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1220266935 256)) (and (= 0 (mod ~y$r_buff1_thd3~0_In1220266935 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out1220266935| |P2Thread1of1ForFork2_#t~ite27_Out1220266935|) (= |P2Thread1of1ForFork2_#t~ite26_Out1220266935| ~y$w_buff0_used~0_In1220266935)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1220266935, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1220266935|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220266935, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1220266935, ~weak$$choice2~0=~weak$$choice2~0_In1220266935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220266935} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1220266935|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1220266935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220266935, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1220266935, ~weak$$choice2~0=~weak$$choice2~0_In1220266935, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1220266935|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220266935} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 22:53:35,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L784-->L784-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1946984747 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1946984747 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-1946984747 256) 0)) (= (mod ~y$w_buff0_used~0_In-1946984747 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1946984747 256))))) (= ~y$w_buff1_used~0_In-1946984747 |P2Thread1of1ForFork2_#t~ite29_Out-1946984747|) .cse1 (= |P2Thread1of1ForFork2_#t~ite30_Out-1946984747| |P2Thread1of1ForFork2_#t~ite29_Out-1946984747|)) (and (= |P2Thread1of1ForFork2_#t~ite29_In-1946984747| |P2Thread1of1ForFork2_#t~ite29_Out-1946984747|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite30_Out-1946984747| ~y$w_buff1_used~0_In-1946984747)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1946984747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1946984747, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1946984747, ~weak$$choice2~0=~weak$$choice2~0_In-1946984747, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1946984747|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1946984747} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1946984747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1946984747, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1946984747|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1946984747, ~weak$$choice2~0=~weak$$choice2~0_In-1946984747, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1946984747|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1946984747} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 22:53:35,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd3~0_57 v_~y$r_buff0_thd3~0_56)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_56, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 22:53:35,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_22 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 22:53:35,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-2121159466 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-2121159466 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-2121159466 |P2Thread1of1ForFork2_#t~ite38_Out-2121159466|)) (and (= ~y$w_buff1~0_In-2121159466 |P2Thread1of1ForFork2_#t~ite38_Out-2121159466|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2121159466, ~y$w_buff1~0=~y$w_buff1~0_In-2121159466, ~y~0=~y~0_In-2121159466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121159466} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2121159466, ~y$w_buff1~0=~y$w_buff1~0_In-2121159466, ~y~0=~y~0_In-2121159466, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-2121159466|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121159466} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 22:53:35,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1060329020 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1060329020 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1060329020|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1060329020 |P0Thread1of1ForFork0_#t~ite5_Out-1060329020|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060329020, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1060329020} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1060329020|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060329020, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1060329020} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:53:35,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-586514850 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-586514850 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-586514850 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-586514850 256)))) (or (and (= ~y$w_buff1_used~0_In-586514850 |P0Thread1of1ForFork0_#t~ite6_Out-586514850|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-586514850| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-586514850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-586514850, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-586514850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-586514850} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-586514850|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-586514850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-586514850, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-586514850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-586514850} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:53:35,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In249690634 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In249690634 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out249690634| |P1Thread1of1ForFork1_#t~ite9_Out249690634|))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In249690634 |P1Thread1of1ForFork1_#t~ite9_Out249690634|) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~y~0_In249690634 |P1Thread1of1ForFork1_#t~ite9_Out249690634|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In249690634, ~y$w_buff1~0=~y$w_buff1~0_In249690634, ~y~0=~y~0_In249690634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In249690634} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In249690634, ~y$w_buff1~0=~y$w_buff1~0_In249690634, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out249690634|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out249690634|, ~y~0=~y~0_In249690634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In249690634} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 22:53:35,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= |v_P2Thread1of1ForFork2_#t~ite38_8| v_~y~0_19) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_8|} OutVars{~y~0=v_~y~0_19, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_7|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 22:53:35,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In623947279 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In623947279 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out623947279|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In623947279 |P2Thread1of1ForFork2_#t~ite40_Out623947279|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In623947279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In623947279} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In623947279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In623947279, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out623947279|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 22:53:35,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-146452310 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-146452310 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-146452310 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-146452310 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-146452310|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-146452310 |P2Thread1of1ForFork2_#t~ite41_Out-146452310|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-146452310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-146452310, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-146452310, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-146452310} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-146452310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-146452310, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-146452310|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-146452310, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-146452310} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 22:53:35,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In831924050 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In831924050 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In831924050 |P2Thread1of1ForFork2_#t~ite42_Out831924050|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out831924050| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In831924050, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831924050} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In831924050, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out831924050|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831924050} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 22:53:35,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2072975159 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2072975159 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2072975159 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-2072975159 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-2072975159| 0)) (and (= ~y$r_buff1_thd3~0_In-2072975159 |P2Thread1of1ForFork2_#t~ite43_Out-2072975159|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2072975159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072975159, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2072975159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2072975159} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2072975159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072975159, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2072975159, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-2072975159|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2072975159} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 22:53:35,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~y$r_buff1_thd3~0_45) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:53:35,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1957892516 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1957892516 256)))) (or (and (= ~y$r_buff0_thd1~0_Out1957892516 ~y$r_buff0_thd1~0_In1957892516) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out1957892516 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1957892516, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1957892516} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1957892516, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1957892516|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1957892516} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:53:35,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In810075456 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In810075456 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In810075456 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In810075456 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out810075456| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In810075456 |P0Thread1of1ForFork0_#t~ite8_Out810075456|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In810075456, ~y$w_buff0_used~0=~y$w_buff0_used~0_In810075456, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In810075456, ~y$w_buff1_used~0=~y$w_buff1_used~0_In810075456} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In810075456, ~y$w_buff0_used~0=~y$w_buff0_used~0_In810075456, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out810075456|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In810075456, ~y$w_buff1_used~0=~y$w_buff1_used~0_In810075456} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:53:35,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:53:35,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1614736200 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1614736200 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1614736200|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1614736200| ~y$w_buff0_used~0_In-1614736200) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614736200, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1614736200} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614736200, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1614736200, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1614736200|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:53:35,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1969145117 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1969145117 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1969145117 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1969145117 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1969145117| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1969145117| ~y$w_buff1_used~0_In-1969145117) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1969145117, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1969145117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1969145117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1969145117} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1969145117, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1969145117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1969145117, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1969145117|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1969145117} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:53:35,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-460150441 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-460150441 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-460150441| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-460150441| ~y$r_buff0_thd2~0_In-460150441) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460150441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-460150441} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-460150441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-460150441, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-460150441|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:53:35,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-439789974 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-439789974 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-439789974 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-439789974 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-439789974| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-439789974| ~y$r_buff1_thd2~0_In-439789974) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-439789974, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-439789974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-439789974, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-439789974} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-439789974, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-439789974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-439789974, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-439789974|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-439789974} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:53:35,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L763-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:53:35,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$r_buff0_thd0~0_14 256) 0) (= 0 (mod v_~y$w_buff0_used~0_86 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:53:35,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In517626740 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In517626740 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out517626740| ~y$w_buff1~0_In517626740) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In517626740 |ULTIMATE.start_main_#t~ite47_Out517626740|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In517626740, ~y~0=~y~0_In517626740, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In517626740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In517626740} OutVars{~y$w_buff1~0=~y$w_buff1~0_In517626740, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out517626740|, ~y~0=~y~0_In517626740, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In517626740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In517626740} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 22:53:35,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-27 22:53:35,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-951108261 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-951108261 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-951108261|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-951108261 |ULTIMATE.start_main_#t~ite49_Out-951108261|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-951108261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-951108261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-951108261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-951108261, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-951108261|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 22:53:35,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1902736030 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1902736030 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1902736030 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1902736030 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1902736030 |ULTIMATE.start_main_#t~ite50_Out1902736030|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1902736030|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1902736030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1902736030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1902736030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902736030} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1902736030|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1902736030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1902736030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1902736030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902736030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 22:53:35,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1122341445 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1122341445 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1122341445 |ULTIMATE.start_main_#t~ite51_Out-1122341445|)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1122341445| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122341445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122341445} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1122341445|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122341445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122341445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 22:53:35,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1060148761 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1060148761 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1060148761 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1060148761 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1060148761| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out1060148761| ~y$r_buff1_thd0~0_In1060148761) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1060148761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1060148761, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1060148761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1060148761} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1060148761|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1060148761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1060148761, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1060148761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1060148761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 22:53:35,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_10 256)) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~y$r_buff1_thd0~0_15) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~__unbuffered_p2_EAX~0_9 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x~0_12 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_12, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:53:35,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:53:35 BasicIcfg [2019-12-27 22:53:35,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:53:35,144 INFO L168 Benchmark]: Toolchain (without parser) took 135035.42 ms. Allocated memory was 146.3 MB in the beginning and 4.6 GB in the end (delta: 4.5 GB). Free memory was 101.6 MB in the beginning and 802.1 MB in the end (delta: -700.5 MB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. [2019-12-27 22:53:35,144 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:53:35,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.79 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.2 MB in the beginning and 157.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:53:35,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.28 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.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:53:35,146 INFO L168 Benchmark]: Boogie Preprocessor took 56.81 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:53:35,146 INFO L168 Benchmark]: RCFGBuilder took 1025.67 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 102.8 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:53:35,147 INFO L168 Benchmark]: TraceAbstraction took 133077.45 ms. Allocated memory was 203.9 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 102.1 MB in the beginning and 802.1 MB in the end (delta: -700.0 MB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. [2019-12-27 22:53:35,149 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.79 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.2 MB in the beginning and 157.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.28 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.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.81 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1025.67 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 102.8 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 133077.45 ms. Allocated memory was 203.9 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 102.1 MB in the beginning and 802.1 MB in the end (delta: -700.0 MB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 174 ProgramPointsBefore, 95 ProgramPointsAfterwards, 211 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 31 ChoiceCompositions, 6393 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81281 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2408, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2409, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2410, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 132.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 56.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6929 SDtfs, 11408 SDslu, 32170 SDs, 0 SdLazy, 26581 SolverSat, 659 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 170 SyntacticMatches, 73 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7599 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161396occurred 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: 41.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 343114 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1246 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1153 ConstructedInterpolants, 0 QuantifiedInterpolants, 236905 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...