/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/mix019_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:19:35,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:19:35,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:19:35,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:19:35,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:19:35,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:19:35,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:19:35,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:19:35,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:19:35,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:19:35,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:19:35,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:19:35,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:19:35,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:19:35,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:19:35,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:19:35,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:19:35,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:19:35,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:19:35,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:19:35,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:19:35,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:19:35,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:19:35,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:19:35,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:19:35,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:19:35,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:19:35,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:19:35,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:19:35,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:19:35,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:19:35,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:19:35,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:19:35,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:19:35,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:19:35,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:19:35,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:19:35,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:19:35,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:19:35,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:19:35,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:19:35,842 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 20:19:35,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:19:35,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:19:35,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:19:35,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:19:35,861 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:19:35,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:19:35,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:19:35,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:19:35,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:19:35,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:19:35,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:19:35,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:19:35,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:19:35,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:19:35,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:19:35,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:19:35,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:19:35,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:19:35,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:19:35,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:19:35,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:19:35,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:19:35,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:19:35,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:19:35,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:19:35,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:19:35,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:19:35,867 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:19:35,867 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:19:35,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:19:35,867 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:19:35,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:19:36,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:19:36,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:19:36,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:19:36,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:19:36,159 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:19:36,160 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-27 20:19:36,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5fec3eb6/0f94ec782bcf4f05b56d1bb08a5a7f8e/FLAG2a01e51ec [2019-12-27 20:19:36,816 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:19:36,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-27 20:19:36,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5fec3eb6/0f94ec782bcf4f05b56d1bb08a5a7f8e/FLAG2a01e51ec [2019-12-27 20:19:37,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5fec3eb6/0f94ec782bcf4f05b56d1bb08a5a7f8e [2019-12-27 20:19:37,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:19:37,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:19:37,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:19:37,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:19:37,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:19:37,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:37,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdc9fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37, skipping insertion in model container [2019-12-27 20:19:37,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:37,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:19:37,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:19:37,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:19:37,810 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:19:37,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:19:37,978 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:19:37,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37 WrapperNode [2019-12-27 20:19:37,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:19:37,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:19:37,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:19:37,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:19:37,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:19:38,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:19:38,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:19:38,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:19:38,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (1/1) ... [2019-12-27 20:19:38,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:19:38,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:19:38,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:19:38,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:19:38,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (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 20:19:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:19:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:19:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:19:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:19:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:19:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:19:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:19:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:19:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:19:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:19:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:19:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:19:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:19:38,175 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 20:19:39,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:19:39,038 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:19:39,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:19:39 BoogieIcfgContainer [2019-12-27 20:19:39,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:19:39,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:19:39,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:19:39,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:19:39,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:19:37" (1/3) ... [2019-12-27 20:19:39,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc95b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:19:39, skipping insertion in model container [2019-12-27 20:19:39,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:19:37" (2/3) ... [2019-12-27 20:19:39,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc95b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:19:39, skipping insertion in model container [2019-12-27 20:19:39,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:19:39" (3/3) ... [2019-12-27 20:19:39,049 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_pso.oepc.i [2019-12-27 20:19:39,059 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:19:39,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:19:39,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:19:39,073 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:19:39,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,117 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,119 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,119 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,128 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,128 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,190 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,201 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:19:39,217 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:19:39,238 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:19:39,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:19:39,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:19:39,239 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:19:39,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:19:39,239 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:19:39,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:19:39,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:19:39,257 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 20:19:39,259 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:19:39,404 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:19:39,405 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:19:39,422 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:19:39,451 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:19:39,505 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:19:39,506 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:19:39,514 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:19:39,536 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:19:39,537 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:19:42,639 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 20:19:43,271 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 20:19:43,410 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:19:43,440 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 20:19:43,440 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 20:19:43,444 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 20:20:04,367 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 20:20:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 20:20:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:20:04,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:04,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:20:04,376 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 20:20:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 20:20:04,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:04,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054391611] [2019-12-27 20:20:04,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:04,691 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 20:20:04,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054391611] [2019-12-27 20:20:04,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:04,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:20:04,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462168600] [2019-12-27 20:20:04,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:04,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:04,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:20:04,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:04,718 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:04,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:20:04,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:20:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:04,738 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 20:20:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:08,183 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 20:20:08,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:20:08,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:20:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:08,856 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 20:20:08,856 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 20:20:08,858 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 20:20:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 20:20:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 20:20:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 20:20:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 20:20:22,489 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 20:20:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:22,489 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 20:20:22,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:20:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 20:20:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:20:22,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:22,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:22,494 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 20:20:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:22,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 20:20:22,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:22,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023459161] [2019-12-27 20:20:22,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:22,626 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 20:20:22,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023459161] [2019-12-27 20:20:22,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:22,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:22,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388483636] [2019-12-27 20:20:22,627 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:22,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:22,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:20:22,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:22,632 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:22,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:20:22,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:22,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:20:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:20:22,635 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 20:20:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:23,863 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 20:20:23,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:20:23,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:20:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:29,561 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 20:20:29,561 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 20:20:29,562 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 20:20:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 20:20:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 20:20:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 20:20:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 20:20:44,558 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 20:20:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:44,558 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 20:20:44,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:20:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 20:20:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:20:44,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:44,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:44,566 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 20:20:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:44,566 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 20:20:44,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:44,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970090406] [2019-12-27 20:20:44,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:44,638 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 20:20:44,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970090406] [2019-12-27 20:20:44,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:44,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:44,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713244886] [2019-12-27 20:20:44,640 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:44,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:44,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:20:44,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:44,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:44,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:20:44,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:20:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:44,645 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 20:20:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:44,795 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 20:20:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:20:44,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:20:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:44,852 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 20:20:44,852 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 20:20:44,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 20:20:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 20:20:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 20:20:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 20:20:45,460 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 20:20:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:45,460 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 20:20:45,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:20:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 20:20:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:20:45,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:45,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:45,463 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 20:20:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 20:20:45,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:45,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132677557] [2019-12-27 20:20:45,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:45,548 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 20:20:45,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132677557] [2019-12-27 20:20:45,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:45,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:20:45,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [651603317] [2019-12-27 20:20:45,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:45,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:45,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:20:45,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:45,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:45,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:20:45,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:45,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:20:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:45,560 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 20:20:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:45,789 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 20:20:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:20:45,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:20:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:45,898 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 20:20:45,898 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 20:20:45,898 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 20:20:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 20:20:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 20:20:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 20:20:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 20:20:47,905 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 20:20:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:47,906 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 20:20:47,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:20:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 20:20:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:20:47,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:47,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:47,909 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 20:20:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:47,910 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 20:20:47,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:47,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218111222] [2019-12-27 20:20:47,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:47,986 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 20:20:47,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218111222] [2019-12-27 20:20:47,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:47,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:47,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002403953] [2019-12-27 20:20:47,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:47,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:47,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:20:47,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:47,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:47,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:20:47,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:20:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:20:47,993 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 20:20:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:48,428 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 20:20:48,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:20:48,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:20:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:48,506 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 20:20:48,506 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 20:20:48,506 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 20:20:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 20:20:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 20:20:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 20:20:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 20:20:50,040 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 20:20:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:50,040 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 20:20:50,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:20:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 20:20:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:20:50,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:50,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:50,044 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 20:20:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 20:20:50,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:50,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137254479] [2019-12-27 20:20:50,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:50,142 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 20:20:50,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137254479] [2019-12-27 20:20:50,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:50,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:50,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [14526732] [2019-12-27 20:20:50,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:50,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:50,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:20:50,152 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:50,152 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:50,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:20:50,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:50,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:20:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:20:50,154 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 20:20:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:50,564 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 20:20:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:20:50,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:20:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:50,661 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 20:20:50,661 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 20:20:50,661 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 20:20:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 20:20:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 20:20:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 20:20:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 20:20:52,231 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 20:20:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:52,231 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 20:20:52,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:20:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 20:20:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:20:52,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:52,241 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 20:20:52,241 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 20:20:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 20:20:52,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:52,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870214617] [2019-12-27 20:20:52,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:52,441 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 20:20:52,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870214617] [2019-12-27 20:20:52,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:52,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:20:52,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [160834557] [2019-12-27 20:20:52,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:52,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:52,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 60 transitions. [2019-12-27 20:20:52,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:52,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:20:52,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:20:52,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:20:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:20:52,469 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 7 states. [2019-12-27 20:20:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:53,738 INFO L93 Difference]: Finished difference Result 63407 states and 201418 transitions. [2019-12-27 20:20:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:20:53,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:20:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:53,847 INFO L225 Difference]: With dead ends: 63407 [2019-12-27 20:20:53,848 INFO L226 Difference]: Without dead ends: 63400 [2019-12-27 20:20:53,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:20:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63400 states. [2019-12-27 20:20:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63400 to 47584. [2019-12-27 20:20:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2019-12-27 20:20:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 154270 transitions. [2019-12-27 20:20:55,542 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 154270 transitions. Word has length 22 [2019-12-27 20:20:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:55,543 INFO L462 AbstractCegarLoop]: Abstraction has 47584 states and 154270 transitions. [2019-12-27 20:20:55,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:20:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 154270 transitions. [2019-12-27 20:20:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:20:55,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:55,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:55,552 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 20:20:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:55,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 20:20:55,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:55,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213884360] [2019-12-27 20:20:55,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:55,713 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 20:20:55,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213884360] [2019-12-27 20:20:55,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:55,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:20:55,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358244001] [2019-12-27 20:20:55,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:55,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:55,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 60 transitions. [2019-12-27 20:20:55,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:55,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:20:55,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:20:55,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:20:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:20:55,727 INFO L87 Difference]: Start difference. First operand 47584 states and 154270 transitions. Second operand 7 states. [2019-12-27 20:20:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:56,846 INFO L93 Difference]: Finished difference Result 66798 states and 212192 transitions. [2019-12-27 20:20:56,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:20:56,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:20:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:56,963 INFO L225 Difference]: With dead ends: 66798 [2019-12-27 20:20:56,963 INFO L226 Difference]: Without dead ends: 66791 [2019-12-27 20:20:56,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:20:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66791 states. [2019-12-27 20:20:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66791 to 46419. [2019-12-27 20:20:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46419 states. [2019-12-27 20:20:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46419 states to 46419 states and 150561 transitions. [2019-12-27 20:20:58,738 INFO L78 Accepts]: Start accepts. Automaton has 46419 states and 150561 transitions. Word has length 22 [2019-12-27 20:20:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:58,738 INFO L462 AbstractCegarLoop]: Abstraction has 46419 states and 150561 transitions. [2019-12-27 20:20:58,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:20:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 46419 states and 150561 transitions. [2019-12-27 20:20:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:20:58,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:58,750 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 20:20:58,750 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 20:20:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 20:20:58,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:58,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137682513] [2019-12-27 20:20:58,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:58,794 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 20:20:58,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137682513] [2019-12-27 20:20:58,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:58,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:20:58,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317288294] [2019-12-27 20:20:58,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:58,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:58,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:20:58,812 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:58,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:20:58,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:20:58,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:20:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:20:58,864 INFO L87 Difference]: Start difference. First operand 46419 states and 150561 transitions. Second operand 5 states. [2019-12-27 20:20:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:58,969 INFO L93 Difference]: Finished difference Result 18049 states and 55252 transitions. [2019-12-27 20:20:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:20:58,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:20:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:58,996 INFO L225 Difference]: With dead ends: 18049 [2019-12-27 20:20:58,996 INFO L226 Difference]: Without dead ends: 18049 [2019-12-27 20:20:58,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:20:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18049 states. [2019-12-27 20:20:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18049 to 17686. [2019-12-27 20:20:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17686 states. [2019-12-27 20:20:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17686 states to 17686 states and 54216 transitions. [2019-12-27 20:20:59,257 INFO L78 Accepts]: Start accepts. Automaton has 17686 states and 54216 transitions. Word has length 25 [2019-12-27 20:20:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:59,257 INFO L462 AbstractCegarLoop]: Abstraction has 17686 states and 54216 transitions. [2019-12-27 20:20:59,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:20:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17686 states and 54216 transitions. [2019-12-27 20:20:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:20:59,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:59,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:59,269 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 20:20:59,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1225408676, now seen corresponding path program 1 times [2019-12-27 20:20:59,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:59,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342903866] [2019-12-27 20:20:59,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:59,498 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 20:20:59,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342903866] [2019-12-27 20:20:59,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:59,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:20:59,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [853722033] [2019-12-27 20:20:59,499 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:59,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:59,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 78 transitions. [2019-12-27 20:20:59,521 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:59,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:20:59,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:20:59,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:20:59,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:20:59,677 INFO L87 Difference]: Start difference. First operand 17686 states and 54216 transitions. Second operand 10 states. [2019-12-27 20:21:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:01,301 INFO L93 Difference]: Finished difference Result 43111 states and 129974 transitions. [2019-12-27 20:21:01,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:21:01,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 20:21:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:01,365 INFO L225 Difference]: With dead ends: 43111 [2019-12-27 20:21:01,365 INFO L226 Difference]: Without dead ends: 43111 [2019-12-27 20:21:01,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:21:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43111 states. [2019-12-27 20:21:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43111 to 17830. [2019-12-27 20:21:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17830 states. [2019-12-27 20:21:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17830 states to 17830 states and 54765 transitions. [2019-12-27 20:21:02,378 INFO L78 Accepts]: Start accepts. Automaton has 17830 states and 54765 transitions. Word has length 26 [2019-12-27 20:21:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:02,379 INFO L462 AbstractCegarLoop]: Abstraction has 17830 states and 54765 transitions. [2019-12-27 20:21:02,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:21:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17830 states and 54765 transitions. [2019-12-27 20:21:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:21:02,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:02,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:02,391 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 20:21:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -990805015, now seen corresponding path program 1 times [2019-12-27 20:21:02,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:02,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325793600] [2019-12-27 20:21:02,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:02,584 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 20:21:02,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325793600] [2019-12-27 20:21:02,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:02,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:21:02,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2127242366] [2019-12-27 20:21:02,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:02,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:02,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 90 transitions. [2019-12-27 20:21:02,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:02,735 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:21:02,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:21:02,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:02,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:21:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:21:02,737 INFO L87 Difference]: Start difference. First operand 17830 states and 54765 transitions. Second operand 11 states. [2019-12-27 20:21:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:04,428 INFO L93 Difference]: Finished difference Result 49875 states and 149268 transitions. [2019-12-27 20:21:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 20:21:04,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-12-27 20:21:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:04,505 INFO L225 Difference]: With dead ends: 49875 [2019-12-27 20:21:04,505 INFO L226 Difference]: Without dead ends: 49875 [2019-12-27 20:21:04,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:21:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49875 states. [2019-12-27 20:21:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49875 to 17618. [2019-12-27 20:21:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17618 states. [2019-12-27 20:21:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17618 states to 17618 states and 54118 transitions. [2019-12-27 20:21:04,973 INFO L78 Accepts]: Start accepts. Automaton has 17618 states and 54118 transitions. Word has length 26 [2019-12-27 20:21:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:04,973 INFO L462 AbstractCegarLoop]: Abstraction has 17618 states and 54118 transitions. [2019-12-27 20:21:04,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:21:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17618 states and 54118 transitions. [2019-12-27 20:21:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:21:04,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:04,987 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 20:21:04,987 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 20:21:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 20:21:04,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:04,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081583437] [2019-12-27 20:21:04,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:05,077 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 20:21:05,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081583437] [2019-12-27 20:21:05,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:05,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:21:05,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [767678687] [2019-12-27 20:21:05,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:05,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:05,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:21:05,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:05,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:21:05,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:21:05,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:05,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:21:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:21:05,090 INFO L87 Difference]: Start difference. First operand 17618 states and 54118 transitions. Second operand 5 states. [2019-12-27 20:21:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:05,443 INFO L93 Difference]: Finished difference Result 22269 states and 67256 transitions. [2019-12-27 20:21:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:21:05,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 20:21:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:05,480 INFO L225 Difference]: With dead ends: 22269 [2019-12-27 20:21:05,480 INFO L226 Difference]: Without dead ends: 22269 [2019-12-27 20:21:05,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:21:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22269 states. [2019-12-27 20:21:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22269 to 20881. [2019-12-27 20:21:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20881 states. [2019-12-27 20:21:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20881 states to 20881 states and 63766 transitions. [2019-12-27 20:21:06,263 INFO L78 Accepts]: Start accepts. Automaton has 20881 states and 63766 transitions. Word has length 27 [2019-12-27 20:21:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:06,264 INFO L462 AbstractCegarLoop]: Abstraction has 20881 states and 63766 transitions. [2019-12-27 20:21:06,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:21:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20881 states and 63766 transitions. [2019-12-27 20:21:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:21:06,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:06,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:06,279 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 20:21:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:06,280 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 20:21:06,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:06,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646124358] [2019-12-27 20:21:06,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:06,352 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 20:21:06,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646124358] [2019-12-27 20:21:06,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:06,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:21:06,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [302292992] [2019-12-27 20:21:06,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:06,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:06,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:21:06,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:06,366 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:21:06,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:21:06,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:21:06,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:21:06,367 INFO L87 Difference]: Start difference. First operand 20881 states and 63766 transitions. Second operand 5 states. [2019-12-27 20:21:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:06,857 INFO L93 Difference]: Finished difference Result 24181 states and 72790 transitions. [2019-12-27 20:21:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:21:06,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:21:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:06,903 INFO L225 Difference]: With dead ends: 24181 [2019-12-27 20:21:06,903 INFO L226 Difference]: Without dead ends: 24181 [2019-12-27 20:21:06,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:21:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24181 states. [2019-12-27 20:21:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24181 to 20205. [2019-12-27 20:21:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20205 states. [2019-12-27 20:21:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20205 states to 20205 states and 61740 transitions. [2019-12-27 20:21:07,271 INFO L78 Accepts]: Start accepts. Automaton has 20205 states and 61740 transitions. Word has length 28 [2019-12-27 20:21:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:07,272 INFO L462 AbstractCegarLoop]: Abstraction has 20205 states and 61740 transitions. [2019-12-27 20:21:07,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:21:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20205 states and 61740 transitions. [2019-12-27 20:21:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:21:07,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:07,295 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 20:21:07,295 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 20:21:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 20:21:07,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:07,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897562164] [2019-12-27 20:21:07,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:07,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 20:21:07,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897562164] [2019-12-27 20:21:07,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:07,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:21:07,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1036412932] [2019-12-27 20:21:07,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:07,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:07,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 79 transitions. [2019-12-27 20:21:07,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:07,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:21:07,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:21:07,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:21:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:21:07,417 INFO L87 Difference]: Start difference. First operand 20205 states and 61740 transitions. Second operand 6 states. [2019-12-27 20:21:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:08,138 INFO L93 Difference]: Finished difference Result 28620 states and 85324 transitions. [2019-12-27 20:21:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:21:08,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 20:21:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:08,196 INFO L225 Difference]: With dead ends: 28620 [2019-12-27 20:21:08,197 INFO L226 Difference]: Without dead ends: 28620 [2019-12-27 20:21:08,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:21:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28620 states. [2019-12-27 20:21:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28620 to 21439. [2019-12-27 20:21:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21439 states. [2019-12-27 20:21:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21439 states to 21439 states and 65345 transitions. [2019-12-27 20:21:08,570 INFO L78 Accepts]: Start accepts. Automaton has 21439 states and 65345 transitions. Word has length 33 [2019-12-27 20:21:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:08,570 INFO L462 AbstractCegarLoop]: Abstraction has 21439 states and 65345 transitions. [2019-12-27 20:21:08,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:21:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21439 states and 65345 transitions. [2019-12-27 20:21:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:21:09,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:09,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:09,027 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 20:21:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1366250167, now seen corresponding path program 1 times [2019-12-27 20:21:09,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:09,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042929880] [2019-12-27 20:21:09,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:09,138 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 20:21:09,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042929880] [2019-12-27 20:21:09,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:09,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:21:09,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500749627] [2019-12-27 20:21:09,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:09,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:09,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 82 transitions. [2019-12-27 20:21:09,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:09,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:21:09,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:21:09,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:09,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:21:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:21:09,171 INFO L87 Difference]: Start difference. First operand 21439 states and 65345 transitions. Second operand 6 states. [2019-12-27 20:21:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:09,904 INFO L93 Difference]: Finished difference Result 29191 states and 87175 transitions. [2019-12-27 20:21:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:21:09,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 20:21:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:09,964 INFO L225 Difference]: With dead ends: 29191 [2019-12-27 20:21:09,964 INFO L226 Difference]: Without dead ends: 29191 [2019-12-27 20:21:09,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:21:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29191 states. [2019-12-27 20:21:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29191 to 20475. [2019-12-27 20:21:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20475 states. [2019-12-27 20:21:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20475 states to 20475 states and 62451 transitions. [2019-12-27 20:21:10,662 INFO L78 Accepts]: Start accepts. Automaton has 20475 states and 62451 transitions. Word has length 34 [2019-12-27 20:21:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:10,662 INFO L462 AbstractCegarLoop]: Abstraction has 20475 states and 62451 transitions. [2019-12-27 20:21:10,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:21:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20475 states and 62451 transitions. [2019-12-27 20:21:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:21:10,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:10,702 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 20:21:10,702 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 20:21:10,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 20:21:10,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:10,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193240862] [2019-12-27 20:21:10,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:10,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 20:21:10,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193240862] [2019-12-27 20:21:10,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:10,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:21:10,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87983500] [2019-12-27 20:21:10,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:10,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:10,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 20:21:10,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:10,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:21:10,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:21:10,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:21:10,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:10,905 INFO L87 Difference]: Start difference. First operand 20475 states and 62451 transitions. Second operand 3 states. [2019-12-27 20:21:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:11,042 INFO L93 Difference]: Finished difference Result 20474 states and 62449 transitions. [2019-12-27 20:21:11,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:21:11,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:21:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:11,094 INFO L225 Difference]: With dead ends: 20474 [2019-12-27 20:21:11,094 INFO L226 Difference]: Without dead ends: 20474 [2019-12-27 20:21:11,095 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 20:21:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20474 states. [2019-12-27 20:21:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20474 to 20474. [2019-12-27 20:21:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20474 states. [2019-12-27 20:21:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20474 states to 20474 states and 62449 transitions. [2019-12-27 20:21:11,599 INFO L78 Accepts]: Start accepts. Automaton has 20474 states and 62449 transitions. Word has length 39 [2019-12-27 20:21:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:11,599 INFO L462 AbstractCegarLoop]: Abstraction has 20474 states and 62449 transitions. [2019-12-27 20:21:11,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:21:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20474 states and 62449 transitions. [2019-12-27 20:21:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:21:11,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:11,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:11,632 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 20:21:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 20:21:11,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:11,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097987304] [2019-12-27 20:21:11,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:11,712 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 20:21:11,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097987304] [2019-12-27 20:21:11,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:11,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:21:11,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76965713] [2019-12-27 20:21:11,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:11,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:11,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 488 transitions. [2019-12-27 20:21:11,820 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:11,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:21:11,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:21:11,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:21:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:21:11,938 INFO L87 Difference]: Start difference. First operand 20474 states and 62449 transitions. Second operand 8 states. [2019-12-27 20:21:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:13,480 INFO L93 Difference]: Finished difference Result 28770 states and 86944 transitions. [2019-12-27 20:21:13,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:21:13,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 20:21:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:13,534 INFO L225 Difference]: With dead ends: 28770 [2019-12-27 20:21:13,535 INFO L226 Difference]: Without dead ends: 28770 [2019-12-27 20:21:13,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 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 20:21:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-27 20:21:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 26252. [2019-12-27 20:21:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26252 states. [2019-12-27 20:21:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26252 states to 26252 states and 80005 transitions. [2019-12-27 20:21:13,925 INFO L78 Accepts]: Start accepts. Automaton has 26252 states and 80005 transitions. Word has length 40 [2019-12-27 20:21:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:13,926 INFO L462 AbstractCegarLoop]: Abstraction has 26252 states and 80005 transitions. [2019-12-27 20:21:13,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:21:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 26252 states and 80005 transitions. [2019-12-27 20:21:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:21:13,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:13,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:13,960 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 20:21:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 20:21:13,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:13,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674592977] [2019-12-27 20:21:13,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:21:14,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674592977] [2019-12-27 20:21:14,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:14,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:21:14,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782416985] [2019-12-27 20:21:14,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:14,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:14,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 20:21:14,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:14,113 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:21:14,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:21:14,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:21:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:21:14,114 INFO L87 Difference]: Start difference. First operand 26252 states and 80005 transitions. Second operand 4 states. [2019-12-27 20:21:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:14,446 INFO L93 Difference]: Finished difference Result 35458 states and 105853 transitions. [2019-12-27 20:21:14,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:21:14,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 20:21:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:14,496 INFO L225 Difference]: With dead ends: 35458 [2019-12-27 20:21:14,496 INFO L226 Difference]: Without dead ends: 35458 [2019-12-27 20:21:14,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:21:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35458 states. [2019-12-27 20:21:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35458 to 26148. [2019-12-27 20:21:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26148 states. [2019-12-27 20:21:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26148 states to 26148 states and 78927 transitions. [2019-12-27 20:21:15,579 INFO L78 Accepts]: Start accepts. Automaton has 26148 states and 78927 transitions. Word has length 40 [2019-12-27 20:21:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:15,579 INFO L462 AbstractCegarLoop]: Abstraction has 26148 states and 78927 transitions. [2019-12-27 20:21:15,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:21:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26148 states and 78927 transitions. [2019-12-27 20:21:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:21:15,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:15,611 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 20:21:15,611 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 20:21:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-27 20:21:15,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:15,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906508341] [2019-12-27 20:21:15,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:15,669 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 20:21:15,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906508341] [2019-12-27 20:21:15,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:15,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:21:15,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [414862098] [2019-12-27 20:21:15,670 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:15,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:15,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 356 transitions. [2019-12-27 20:21:15,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:15,766 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:21:15,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:21:15,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:15,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:21:15,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:21:15,767 INFO L87 Difference]: Start difference. First operand 26148 states and 78927 transitions. Second operand 6 states. [2019-12-27 20:21:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:15,869 INFO L93 Difference]: Finished difference Result 24731 states and 75619 transitions. [2019-12-27 20:21:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:21:15,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 20:21:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:15,916 INFO L225 Difference]: With dead ends: 24731 [2019-12-27 20:21:15,916 INFO L226 Difference]: Without dead ends: 24731 [2019-12-27 20:21:15,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:21:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24731 states. [2019-12-27 20:21:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24731 to 23681. [2019-12-27 20:21:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23681 states. [2019-12-27 20:21:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23681 states to 23681 states and 72787 transitions. [2019-12-27 20:21:16,287 INFO L78 Accepts]: Start accepts. Automaton has 23681 states and 72787 transitions. Word has length 41 [2019-12-27 20:21:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:16,287 INFO L462 AbstractCegarLoop]: Abstraction has 23681 states and 72787 transitions. [2019-12-27 20:21:16,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:21:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 23681 states and 72787 transitions. [2019-12-27 20:21:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:21:16,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:16,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:21:16,312 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 20:21:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash 384634377, now seen corresponding path program 1 times [2019-12-27 20:21:16,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:16,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117013077] [2019-12-27 20:21:16,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:16,394 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 20:21:16,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117013077] [2019-12-27 20:21:16,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:16,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:21:16,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [766209088] [2019-12-27 20:21:16,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:16,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:16,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 624 transitions. [2019-12-27 20:21:16,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:16,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:21:16,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:21:16,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:21:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:21:16,757 INFO L87 Difference]: Start difference. First operand 23681 states and 72787 transitions. Second operand 9 states. [2019-12-27 20:21:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:18,558 INFO L93 Difference]: Finished difference Result 30987 states and 94156 transitions. [2019-12-27 20:21:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:21:18,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 20:21:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:18,601 INFO L225 Difference]: With dead ends: 30987 [2019-12-27 20:21:18,602 INFO L226 Difference]: Without dead ends: 30987 [2019-12-27 20:21:18,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:21:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30987 states. [2019-12-27 20:21:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30987 to 24874. [2019-12-27 20:21:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24874 states. [2019-12-27 20:21:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24874 states to 24874 states and 76422 transitions. [2019-12-27 20:21:19,007 INFO L78 Accepts]: Start accepts. Automaton has 24874 states and 76422 transitions. Word has length 65 [2019-12-27 20:21:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:19,007 INFO L462 AbstractCegarLoop]: Abstraction has 24874 states and 76422 transitions. [2019-12-27 20:21:19,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:21:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 24874 states and 76422 transitions. [2019-12-27 20:21:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:21:19,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:19,038 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 20:21:19,038 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 20:21:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1572101585, now seen corresponding path program 2 times [2019-12-27 20:21:19,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:19,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12882228] [2019-12-27 20:21:19,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:19,126 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 20:21:19,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12882228] [2019-12-27 20:21:19,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:19,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:21:19,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394057561] [2019-12-27 20:21:19,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:19,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:19,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 385 states and 829 transitions. [2019-12-27 20:21:19,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:19,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:21:19,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:21:19,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:21:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:19,577 INFO L87 Difference]: Start difference. First operand 24874 states and 76422 transitions. Second operand 3 states. [2019-12-27 20:21:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:19,738 INFO L93 Difference]: Finished difference Result 31394 states and 95889 transitions. [2019-12-27 20:21:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:21:19,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:21:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:19,780 INFO L225 Difference]: With dead ends: 31394 [2019-12-27 20:21:19,781 INFO L226 Difference]: Without dead ends: 31394 [2019-12-27 20:21:19,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 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 20:21:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31394 states. [2019-12-27 20:21:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31394 to 26267. [2019-12-27 20:21:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26267 states. [2019-12-27 20:21:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26267 states to 26267 states and 80885 transitions. [2019-12-27 20:21:20,714 INFO L78 Accepts]: Start accepts. Automaton has 26267 states and 80885 transitions. Word has length 65 [2019-12-27 20:21:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:20,714 INFO L462 AbstractCegarLoop]: Abstraction has 26267 states and 80885 transitions. [2019-12-27 20:21:20,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:21:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26267 states and 80885 transitions. [2019-12-27 20:21:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:21:20,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:20,742 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 20:21:20,742 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 20:21:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1224939563, now seen corresponding path program 1 times [2019-12-27 20:21:20,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:20,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696055312] [2019-12-27 20:21:20,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:20,799 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 20:21:20,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696055312] [2019-12-27 20:21:20,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:20,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:21:20,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920502799] [2019-12-27 20:21:20,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:20,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:21,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 632 transitions. [2019-12-27 20:21:21,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:21,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:21:21,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:21:21,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:21:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:21,116 INFO L87 Difference]: Start difference. First operand 26267 states and 80885 transitions. Second operand 3 states. [2019-12-27 20:21:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:21,341 INFO L93 Difference]: Finished difference Result 37494 states and 116079 transitions. [2019-12-27 20:21:21,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:21:21,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:21:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:21,398 INFO L225 Difference]: With dead ends: 37494 [2019-12-27 20:21:21,398 INFO L226 Difference]: Without dead ends: 37494 [2019-12-27 20:21:21,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:21:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37494 states. [2019-12-27 20:21:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37494 to 26635. [2019-12-27 20:21:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26635 states. [2019-12-27 20:21:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26635 states to 26635 states and 82133 transitions. [2019-12-27 20:21:21,851 INFO L78 Accepts]: Start accepts. Automaton has 26635 states and 82133 transitions. Word has length 66 [2019-12-27 20:21:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:21,852 INFO L462 AbstractCegarLoop]: Abstraction has 26635 states and 82133 transitions. [2019-12-27 20:21:21,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:21:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 26635 states and 82133 transitions. [2019-12-27 20:21:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:21:21,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:21,880 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 20:21:21,880 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 20:21:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1882560525, now seen corresponding path program 2 times [2019-12-27 20:21:21,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:21,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427737947] [2019-12-27 20:21:21,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:22,417 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 20:21:22,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427737947] [2019-12-27 20:21:22,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:22,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:21:22,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379766202] [2019-12-27 20:21:22,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:22,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:22,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 369 states and 787 transitions. [2019-12-27 20:21:22,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:22,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:21:22,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:21:22,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:21:22,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:21:22,873 INFO L87 Difference]: Start difference. First operand 26635 states and 82133 transitions. Second operand 4 states. [2019-12-27 20:21:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:23,005 INFO L93 Difference]: Finished difference Result 26635 states and 81893 transitions. [2019-12-27 20:21:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:21:23,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 20:21:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:23,042 INFO L225 Difference]: With dead ends: 26635 [2019-12-27 20:21:23,042 INFO L226 Difference]: Without dead ends: 26635 [2019-12-27 20:21:23,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 3 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 20:21:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26635 states. [2019-12-27 20:21:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26635 to 24130. [2019-12-27 20:21:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24130 states. [2019-12-27 20:21:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 73973 transitions. [2019-12-27 20:21:23,415 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 73973 transitions. Word has length 66 [2019-12-27 20:21:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:23,416 INFO L462 AbstractCegarLoop]: Abstraction has 24130 states and 73973 transitions. [2019-12-27 20:21:23,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:21:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 73973 transitions. [2019-12-27 20:21:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:21:23,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:23,444 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 20:21:23,444 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 20:21:23,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:23,444 INFO L82 PathProgramCache]: Analyzing trace with hash 158811229, now seen corresponding path program 1 times [2019-12-27 20:21:23,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:23,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404911143] [2019-12-27 20:21:23,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:23,798 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 20:21:23,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404911143] [2019-12-27 20:21:23,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:23,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:21:23,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426702955] [2019-12-27 20:21:23,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:23,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:24,565 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 306 states and 627 transitions. [2019-12-27 20:21:24,565 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:24,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:21:24,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:21:24,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:21:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:21:24,839 INFO L87 Difference]: Start difference. First operand 24130 states and 73973 transitions. Second operand 14 states. [2019-12-27 20:21:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:29,173 INFO L93 Difference]: Finished difference Result 35260 states and 105862 transitions. [2019-12-27 20:21:29,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:21:29,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 20:21:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:29,220 INFO L225 Difference]: With dead ends: 35260 [2019-12-27 20:21:29,221 INFO L226 Difference]: Without dead ends: 35260 [2019-12-27 20:21:29,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 20:21:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35260 states. [2019-12-27 20:21:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35260 to 28019. [2019-12-27 20:21:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28019 states. [2019-12-27 20:21:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28019 states to 28019 states and 85519 transitions. [2019-12-27 20:21:29,700 INFO L78 Accepts]: Start accepts. Automaton has 28019 states and 85519 transitions. Word has length 66 [2019-12-27 20:21:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:29,700 INFO L462 AbstractCegarLoop]: Abstraction has 28019 states and 85519 transitions. [2019-12-27 20:21:29,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:21:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28019 states and 85519 transitions. [2019-12-27 20:21:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:21:29,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:29,730 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 20:21:29,731 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 20:21:29,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1098066777, now seen corresponding path program 2 times [2019-12-27 20:21:29,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:29,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883650227] [2019-12-27 20:21:29,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:29,817 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 20:21:29,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883650227] [2019-12-27 20:21:29,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:29,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:21:29,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1800445855] [2019-12-27 20:21:29,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:29,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:30,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 317 states and 653 transitions. [2019-12-27 20:21:30,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:30,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:21:30,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:21:30,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:30,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:21:30,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:21:30,743 INFO L87 Difference]: Start difference. First operand 28019 states and 85519 transitions. Second operand 10 states. [2019-12-27 20:21:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:32,400 INFO L93 Difference]: Finished difference Result 33619 states and 101434 transitions. [2019-12-27 20:21:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:21:32,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 20:21:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:32,448 INFO L225 Difference]: With dead ends: 33619 [2019-12-27 20:21:32,448 INFO L226 Difference]: Without dead ends: 33619 [2019-12-27 20:21:32,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:21:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33619 states. [2019-12-27 20:21:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33619 to 27857. [2019-12-27 20:21:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27857 states. [2019-12-27 20:21:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27857 states to 27857 states and 85011 transitions. [2019-12-27 20:21:32,896 INFO L78 Accepts]: Start accepts. Automaton has 27857 states and 85011 transitions. Word has length 66 [2019-12-27 20:21:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:32,896 INFO L462 AbstractCegarLoop]: Abstraction has 27857 states and 85011 transitions. [2019-12-27 20:21:32,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:21:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 27857 states and 85011 transitions. [2019-12-27 20:21:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:21:32,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:32,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:32,924 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:32,924 INFO L82 PathProgramCache]: Analyzing trace with hash -70762227, now seen corresponding path program 3 times [2019-12-27 20:21:32,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:32,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532038909] [2019-12-27 20:21:32,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:32,987 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 20:21:32,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532038909] [2019-12-27 20:21:32,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:32,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:21:32,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895694963] [2019-12-27 20:21:32,988 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:33,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:33,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 341 states and 714 transitions. [2019-12-27 20:21:33,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:33,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:21:33,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:21:33,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:33,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:21:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:21:33,625 INFO L87 Difference]: Start difference. First operand 27857 states and 85011 transitions. Second operand 3 states. [2019-12-27 20:21:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:33,708 INFO L93 Difference]: Finished difference Result 27856 states and 85009 transitions. [2019-12-27 20:21:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:21:33,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:21:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:33,749 INFO L225 Difference]: With dead ends: 27856 [2019-12-27 20:21:33,749 INFO L226 Difference]: Without dead ends: 27856 [2019-12-27 20:21:33,749 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 20:21:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27856 states. [2019-12-27 20:21:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27856 to 19377. [2019-12-27 20:21:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19377 states. [2019-12-27 20:21:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19377 states to 19377 states and 60169 transitions. [2019-12-27 20:21:34,092 INFO L78 Accepts]: Start accepts. Automaton has 19377 states and 60169 transitions. Word has length 66 [2019-12-27 20:21:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:34,092 INFO L462 AbstractCegarLoop]: Abstraction has 19377 states and 60169 transitions. [2019-12-27 20:21:34,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:21:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 19377 states and 60169 transitions. [2019-12-27 20:21:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:34,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:34,111 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 20:21:34,111 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 20:21:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-27 20:21:34,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:34,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528263834] [2019-12-27 20:21:34,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:34,454 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 20:21:34,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528263834] [2019-12-27 20:21:34,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:34,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:21:34,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [655281341] [2019-12-27 20:21:34,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:34,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:34,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 307 states and 628 transitions. [2019-12-27 20:21:34,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:35,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 20:21:35,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:21:35,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:35,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:21:35,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:21:35,204 INFO L87 Difference]: Start difference. First operand 19377 states and 60169 transitions. Second operand 14 states. [2019-12-27 20:21:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:37,864 INFO L93 Difference]: Finished difference Result 52247 states and 162366 transitions. [2019-12-27 20:21:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:21:37,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 20:21:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:37,932 INFO L225 Difference]: With dead ends: 52247 [2019-12-27 20:21:37,932 INFO L226 Difference]: Without dead ends: 47420 [2019-12-27 20:21:37,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 20:21:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47420 states. [2019-12-27 20:21:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47420 to 28836. [2019-12-27 20:21:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28836 states. [2019-12-27 20:21:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28836 states to 28836 states and 90501 transitions. [2019-12-27 20:21:38,519 INFO L78 Accepts]: Start accepts. Automaton has 28836 states and 90501 transitions. Word has length 67 [2019-12-27 20:21:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:38,519 INFO L462 AbstractCegarLoop]: Abstraction has 28836 states and 90501 transitions. [2019-12-27 20:21:38,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:21:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28836 states and 90501 transitions. [2019-12-27 20:21:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:38,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:38,551 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 20:21:38,552 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1955892329, now seen corresponding path program 2 times [2019-12-27 20:21:38,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:38,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297896626] [2019-12-27 20:21:38,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:38,860 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 20:21:38,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297896626] [2019-12-27 20:21:38,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:38,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:21:38,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633543684] [2019-12-27 20:21:38,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:38,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:39,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 394 states and 842 transitions. [2019-12-27 20:21:39,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:39,842 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:21:39,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:21:39,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:21:39,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:21:39,843 INFO L87 Difference]: Start difference. First operand 28836 states and 90501 transitions. Second operand 15 states. [2019-12-27 20:21:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:42,852 INFO L93 Difference]: Finished difference Result 58680 states and 181759 transitions. [2019-12-27 20:21:42,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 20:21:42,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 20:21:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:42,920 INFO L225 Difference]: With dead ends: 58680 [2019-12-27 20:21:42,921 INFO L226 Difference]: Without dead ends: 46800 [2019-12-27 20:21:42,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:21:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46800 states. [2019-12-27 20:21:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46800 to 22299. [2019-12-27 20:21:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22299 states. [2019-12-27 20:21:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22299 states to 22299 states and 68486 transitions. [2019-12-27 20:21:43,421 INFO L78 Accepts]: Start accepts. Automaton has 22299 states and 68486 transitions. Word has length 67 [2019-12-27 20:21:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:43,421 INFO L462 AbstractCegarLoop]: Abstraction has 22299 states and 68486 transitions. [2019-12-27 20:21:43,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:21:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22299 states and 68486 transitions. [2019-12-27 20:21:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:43,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:43,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:21:43,447 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:43,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash 872129507, now seen corresponding path program 3 times [2019-12-27 20:21:43,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:43,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417162581] [2019-12-27 20:21:43,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:43,525 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 20:21:43,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417162581] [2019-12-27 20:21:43,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:43,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:21:43,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081957584] [2019-12-27 20:21:43,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:43,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:43,974 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 345 states and 703 transitions. [2019-12-27 20:21:43,974 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:44,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:21:44,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:21:44,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:21:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:21:44,103 INFO L87 Difference]: Start difference. First operand 22299 states and 68486 transitions. Second operand 10 states. [2019-12-27 20:21:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:44,917 INFO L93 Difference]: Finished difference Result 40604 states and 121771 transitions. [2019-12-27 20:21:44,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:21:44,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 20:21:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:44,968 INFO L225 Difference]: With dead ends: 40604 [2019-12-27 20:21:44,968 INFO L226 Difference]: Without dead ends: 36605 [2019-12-27 20:21:44,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:21:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36605 states. [2019-12-27 20:21:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36605 to 22132. [2019-12-27 20:21:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22132 states. [2019-12-27 20:21:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22132 states to 22132 states and 67948 transitions. [2019-12-27 20:21:45,573 INFO L78 Accepts]: Start accepts. Automaton has 22132 states and 67948 transitions. Word has length 67 [2019-12-27 20:21:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:45,573 INFO L462 AbstractCegarLoop]: Abstraction has 22132 states and 67948 transitions. [2019-12-27 20:21:45,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:21:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 22132 states and 67948 transitions. [2019-12-27 20:21:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:45,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:45,598 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 20:21:45,598 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -673154253, now seen corresponding path program 4 times [2019-12-27 20:21:45,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:45,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918974306] [2019-12-27 20:21:45,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:45,903 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 20:21:45,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918974306] [2019-12-27 20:21:45,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:45,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:21:45,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [558837171] [2019-12-27 20:21:45,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:45,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:46,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 329 states and 671 transitions. [2019-12-27 20:21:46,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:46,770 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 20:21:46,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:21:46,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:21:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:21:46,771 INFO L87 Difference]: Start difference. First operand 22132 states and 67948 transitions. Second operand 18 states. [2019-12-27 20:21:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:49,675 INFO L93 Difference]: Finished difference Result 27893 states and 84058 transitions. [2019-12-27 20:21:49,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 20:21:49,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 20:21:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:49,713 INFO L225 Difference]: With dead ends: 27893 [2019-12-27 20:21:49,713 INFO L226 Difference]: Without dead ends: 26162 [2019-12-27 20:21:49,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:21:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26162 states. [2019-12-27 20:21:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26162 to 21284. [2019-12-27 20:21:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21284 states. [2019-12-27 20:21:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21284 states to 21284 states and 65635 transitions. [2019-12-27 20:21:50,275 INFO L78 Accepts]: Start accepts. Automaton has 21284 states and 65635 transitions. Word has length 67 [2019-12-27 20:21:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:50,276 INFO L462 AbstractCegarLoop]: Abstraction has 21284 states and 65635 transitions. [2019-12-27 20:21:50,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:21:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21284 states and 65635 transitions. [2019-12-27 20:21:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:50,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:50,297 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 20:21:50,297 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:50,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 5 times [2019-12-27 20:21:50,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:50,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768414598] [2019-12-27 20:21:50,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:21:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:21:50,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:21:50,419 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:21:50,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~__unbuffered_p1_EAX~0_14) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t503~0.base_21|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t503~0.base_21| 4) |v_#length_21|) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t503~0.base_21|)) (= 0 v_~z$w_buff1_used~0_73) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_21|) |v_ULTIMATE.start_main_~#t503~0.offset_16| 0)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t503~0.offset_16| 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= 0 v_~y~0_8) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t503~0.base_21| 1)) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t503~0.base=|v_ULTIMATE.start_main_~#t503~0.base_21|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_17, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_15|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ULTIMATE.start_main_~#t503~0.offset=|v_ULTIMATE.start_main_~#t503~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_15|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t503~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t505~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t504~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t505~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t503~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t504~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:21:50,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 20:21:50,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t504~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t504~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t504~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t504~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11|) |v_ULTIMATE.start_main_~#t504~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11| 1) |v_#valid_31|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t504~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t504~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:21:50,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t505~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12|) |v_ULTIMATE.start_main_~#t505~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t505~0.base_12| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t505~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t505~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t505~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t505~0.base, #length] because there is no mapped edge [2019-12-27 20:21:50,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1171724948 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1171724948 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1171724948| |P1Thread1of1ForFork2_#t~ite10_Out1171724948|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1171724948| ~z~0_In1171724948) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1171724948| ~z$w_buff1~0_In1171724948) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1171724948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1171724948, ~z$w_buff1~0=~z$w_buff1~0_In1171724948, ~z~0=~z~0_In1171724948} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1171724948|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1171724948, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1171724948|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1171724948, ~z$w_buff1~0=~z$w_buff1~0_In1171724948, ~z~0=~z~0_In1171724948} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:21:50,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1302038429 256)))) (or (and (= ~z$w_buff1~0_In1302038429 |P2Thread1of1ForFork0_#t~ite23_Out1302038429|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1302038429 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1302038429 256))) (= (mod ~z$w_buff0_used~0_In1302038429 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In1302038429 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite23_Out1302038429| |P2Thread1of1ForFork0_#t~ite24_Out1302038429|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In1302038429| |P2Thread1of1ForFork0_#t~ite23_Out1302038429|) (= ~z$w_buff1~0_In1302038429 |P2Thread1of1ForFork0_#t~ite24_Out1302038429|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1302038429, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1302038429, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1302038429|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1302038429, ~z$w_buff1~0=~z$w_buff1~0_In1302038429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1302038429, ~weak$$choice2~0=~weak$$choice2~0_In1302038429} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1302038429, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1302038429|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1302038429, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1302038429|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1302038429, ~z$w_buff1~0=~z$w_buff1~0_In1302038429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1302038429, ~weak$$choice2~0=~weak$$choice2~0_In1302038429} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 20:21:50,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1941086267 256))) (.cse4 (= 0 (mod ~z$r_buff1_thd3~0_In1941086267 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1941086267 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In1941086267 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out1941086267| |P2Thread1of1ForFork0_#t~ite29_Out1941086267|)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1941086267 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In1941086267| |P2Thread1of1ForFork0_#t~ite28_Out1941086267|) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In1941086267| |P2Thread1of1ForFork0_#t~ite29_Out1941086267|) (= |P2Thread1of1ForFork0_#t~ite30_Out1941086267| ~z$w_buff1_used~0_In1941086267) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out1941086267| ~z$w_buff1_used~0_In1941086267) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse0 .cse5))) (let ((.cse6 (not .cse2))) (and (not .cse3) (or .cse6 (not .cse4)) (= |P2Thread1of1ForFork0_#t~ite28_Out1941086267| 0) (or .cse6 (not .cse1)) .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out1941086267| |P2Thread1of1ForFork0_#t~ite29_Out1941086267|) .cse5)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1941086267|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1941086267, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1941086267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1941086267, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1941086267, ~weak$$choice2~0=~weak$$choice2~0_In1941086267, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1941086267|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1941086267|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1941086267, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1941086267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1941086267, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1941086267, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1941086267|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1941086267|, ~weak$$choice2~0=~weak$$choice2~0_In1941086267} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:21:50,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:21:50,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:21:50,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out62558249| |P2Thread1of1ForFork0_#t~ite38_Out62558249|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In62558249 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In62558249 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out62558249| ~z$w_buff1~0_In62558249)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In62558249 |P2Thread1of1ForFork0_#t~ite38_Out62558249|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In62558249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In62558249, ~z$w_buff1~0=~z$w_buff1~0_In62558249, ~z~0=~z~0_In62558249} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out62558249|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out62558249|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In62558249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In62558249, ~z$w_buff1~0=~z$w_buff1~0_In62558249, ~z~0=~z~0_In62558249} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:21:50,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In419670008 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In419670008 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out419670008|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out419670008| ~z$w_buff0_used~0_In419670008)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In419670008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In419670008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In419670008, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out419670008|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In419670008} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:21:50,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-615534042 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-615534042 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-615534042 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-615534042 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-615534042| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-615534042| ~z$w_buff1_used~0_In-615534042) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-615534042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-615534042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-615534042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-615534042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-615534042, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-615534042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-615534042, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-615534042, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-615534042|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:21:50,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In257974088 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In257974088 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out257974088| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out257974088| ~z$r_buff0_thd3~0_In257974088)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In257974088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In257974088} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In257974088, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In257974088, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out257974088|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:21:50,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In175496335 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In175496335 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In175496335 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In175496335 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out175496335| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out175496335| ~z$r_buff1_thd3~0_In175496335)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In175496335, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In175496335, ~z$w_buff1_used~0=~z$w_buff1_used~0_In175496335, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In175496335} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out175496335|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In175496335, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In175496335, ~z$w_buff1_used~0=~z$w_buff1_used~0_In175496335, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In175496335} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:21:50,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:21:50,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1124207779 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1124207779 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1124207779|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1124207779 |P0Thread1of1ForFork1_#t~ite5_Out1124207779|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1124207779, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1124207779} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1124207779|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1124207779, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1124207779} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:21:50,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-353963777 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-353963777 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-353963777 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-353963777 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-353963777 |P0Thread1of1ForFork1_#t~ite6_Out-353963777|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-353963777|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-353963777, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-353963777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-353963777, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-353963777} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-353963777, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-353963777|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-353963777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-353963777, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-353963777} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:21:50,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In774810911 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In774810911 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out774810911 ~z$r_buff0_thd1~0_In774810911)) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out774810911 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In774810911, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In774810911} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In774810911, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out774810911|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out774810911} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:21:50,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-336208733 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-336208733 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-336208733 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-336208733 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-336208733| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-336208733| ~z$r_buff1_thd1~0_In-336208733) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-336208733, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-336208733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-336208733, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-336208733} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-336208733|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-336208733, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-336208733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-336208733, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-336208733} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:21:50,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:21:50,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1964671210 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1964671210 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1964671210|)) (and (= ~z$w_buff0_used~0_In-1964671210 |P1Thread1of1ForFork2_#t~ite11_Out-1964671210|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1964671210, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1964671210} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1964671210, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1964671210|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1964671210} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:21:50,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-187348030 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-187348030 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-187348030 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-187348030 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-187348030| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-187348030 |P1Thread1of1ForFork2_#t~ite12_Out-187348030|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-187348030, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-187348030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-187348030, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-187348030} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-187348030, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-187348030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-187348030, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-187348030|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-187348030} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:21:50,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-632424295 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-632424295 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-632424295|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-632424295 |P1Thread1of1ForFork2_#t~ite13_Out-632424295|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-632424295, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-632424295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-632424295, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-632424295|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-632424295} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:21:50,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-683219727 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-683219727 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-683219727 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-683219727 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-683219727| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-683219727| ~z$r_buff1_thd2~0_In-683219727)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-683219727, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-683219727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-683219727, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-683219727} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-683219727, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-683219727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-683219727, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-683219727|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-683219727} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:21:50,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:21:50,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:21:50,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1418021346 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1418021346 256) 0))) (or (and (= ~z$w_buff1~0_In1418021346 |ULTIMATE.start_main_#t~ite47_Out1418021346|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In1418021346 |ULTIMATE.start_main_#t~ite47_Out1418021346|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1418021346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1418021346, ~z$w_buff1~0=~z$w_buff1~0_In1418021346, ~z~0=~z~0_In1418021346} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1418021346, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1418021346|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1418021346, ~z$w_buff1~0=~z$w_buff1~0_In1418021346, ~z~0=~z~0_In1418021346} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:21:50,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |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_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 20:21:50,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1300331048 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1300331048 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1300331048| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out1300331048| ~z$w_buff0_used~0_In1300331048) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1300331048, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1300331048} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1300331048, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1300331048, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1300331048|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:21:50,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1640669101 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1640669101 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1640669101 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1640669101 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1640669101 |ULTIMATE.start_main_#t~ite50_Out-1640669101|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1640669101|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1640669101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1640669101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1640669101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1640669101} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1640669101|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1640669101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1640669101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1640669101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1640669101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:21:50,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1999373913 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1999373913 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1999373913 |ULTIMATE.start_main_#t~ite51_Out-1999373913|)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1999373913| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1999373913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1999373913} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1999373913, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1999373913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1999373913} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:21:50,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1370383349 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1370383349 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1370383349 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1370383349 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out1370383349| ~z$r_buff1_thd0~0_In1370383349)) (and (= |ULTIMATE.start_main_#t~ite52_Out1370383349| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1370383349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1370383349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1370383349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1370383349} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1370383349|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1370383349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1370383349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1370383349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1370383349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:21:50,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:21:50,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:21:50 BasicIcfg [2019-12-27 20:21:50,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:21:50,528 INFO L168 Benchmark]: Toolchain (without parser) took 133365.26 ms. Allocated memory was 138.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 102.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 20:21:50,528 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:21:50,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.57 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:50,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.63 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 20:21:50,530 INFO L168 Benchmark]: Boogie Preprocessor took 44.99 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:50,530 INFO L168 Benchmark]: RCFGBuilder took 949.62 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 101.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:50,531 INFO L168 Benchmark]: TraceAbstraction took 131485.52 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 101.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:21:50,533 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.51 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.57 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.63 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 44.99 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 949.62 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 101.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 131485.52 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 101.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6457 VarBasedMoverChecksPositive, 198 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t503, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t504, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t505, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 131.1s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6893 SDtfs, 9206 SDslu, 23649 SDs, 0 SdLazy, 17360 SolverSat, 505 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 546 GetRequests, 134 SyntacticMatches, 89 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred 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: 49.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 277965 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1273 NumberOfCodeBlocks, 1273 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1176 ConstructedInterpolants, 0 QuantifiedInterpolants, 303069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...