/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:18:15,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:18:15,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:18:15,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:18:15,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:18:15,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:18:15,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:18:15,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:18:15,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:18:15,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:18:15,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:18:15,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:18:15,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:18:15,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:18:15,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:18:15,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:18:15,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:18:15,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:18:15,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:18:15,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:18:15,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:18:15,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:18:15,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:18:15,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:18:15,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:18:15,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:18:15,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:18:15,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:18:15,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:18:15,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:18:15,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:18:15,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:18:15,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:18:15,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:18:15,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:18:15,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:18:15,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:18:15,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:18:15,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:18:15,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:18:15,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:18:15,714 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.epf [2019-12-27 06:18:15,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:18:15,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:18:15,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:18:15,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:18:15,730 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:18:15,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:18:15,731 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:18:15,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:18:15,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:18:15,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:18:15,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:18:15,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:18:15,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:18:15,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:18:15,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:18:15,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:18:15,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:18:15,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:18:15,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:18:15,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:18:15,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:18:15,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:18:15,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:18:15,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:18:15,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:18:15,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:18:15,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:18:15,735 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:18:15,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:18:15,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:18:16,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:18:16,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:18:16,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:18:16,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:18:16,036 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:18:16,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-27 06:18:16,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f22e71c69/655866562b1c402eabe301ea7ca32aa0/FLAG892621dee [2019-12-27 06:18:16,683 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:18:16,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-27 06:18:16,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f22e71c69/655866562b1c402eabe301ea7ca32aa0/FLAG892621dee [2019-12-27 06:18:17,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f22e71c69/655866562b1c402eabe301ea7ca32aa0 [2019-12-27 06:18:17,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:18:17,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:18:17,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:18:17,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:18:17,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:18:17,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cef981d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17, skipping insertion in model container [2019-12-27 06:18:17,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:18:17,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:18:17,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:18:17,675 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:18:17,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:18:17,832 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:18:17,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17 WrapperNode [2019-12-27 06:18:17,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:18:17,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:18:17,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:18:17,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:18:17,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:18:17,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:18:17,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:18:17,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:18:17,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (1/1) ... [2019-12-27 06:18:17,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:18:17,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:18:17,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:18:17,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:18:17,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (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 06:18:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:18:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:18:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:18:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:18:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:18:18,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:18:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:18:18,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:18:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:18:18,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:18:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:18:18,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:18:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:18:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:18:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:18:18,031 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 06:18:18,817 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:18:18,818 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:18:18,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:18:18 BoogieIcfgContainer [2019-12-27 06:18:18,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:18:18,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:18:18,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:18:18,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:18:18,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:18:17" (1/3) ... [2019-12-27 06:18:18,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39accfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:18:18, skipping insertion in model container [2019-12-27 06:18:18,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:17" (2/3) ... [2019-12-27 06:18:18,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39accfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:18:18, skipping insertion in model container [2019-12-27 06:18:18,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:18:18" (3/3) ... [2019-12-27 06:18:18,828 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_rmo.opt.i [2019-12-27 06:18:18,837 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:18:18,838 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:18:18,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:18:18,847 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:18:18,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,935 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,943 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,944 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,944 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,974 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,974 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,987 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,988 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,996 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,003 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,003 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,003 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:19,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:18:19,040 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:18:19,040 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:18:19,040 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:18:19,040 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:18:19,040 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:18:19,041 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:18:19,041 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:18:19,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:18:19,056 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-27 06:18:19,058 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 06:18:19,164 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 06:18:19,165 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:18:19,181 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:18:19,206 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 06:18:19,262 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 06:18:19,262 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:18:19,270 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:18:19,292 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 06:18:19,293 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:18:22,896 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:18:23,008 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:18:23,449 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-27 06:18:23,606 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-27 06:18:23,625 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77566 [2019-12-27 06:18:23,625 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-27 06:18:23,629 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 06:19:02,142 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 177426 states. [2019-12-27 06:19:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 177426 states. [2019-12-27 06:19:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:19:02,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:02,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:19:02,152 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:19:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1556658876, now seen corresponding path program 1 times [2019-12-27 06:19:02,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:02,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463822101] [2019-12-27 06:19:02,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:02,409 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 06:19:02,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463822101] [2019-12-27 06:19:02,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:02,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:19:02,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107724276] [2019-12-27 06:19:02,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:19:02,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:02,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:19:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:19:02,436 INFO L87 Difference]: Start difference. First operand 177426 states. Second operand 3 states. [2019-12-27 06:19:07,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:07,139 INFO L93 Difference]: Finished difference Result 174206 states and 838758 transitions. [2019-12-27 06:19:07,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:19:07,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:19:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:11,998 INFO L225 Difference]: With dead ends: 174206 [2019-12-27 06:19:12,004 INFO L226 Difference]: Without dead ends: 164066 [2019-12-27 06:19:12,006 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 06:19:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164066 states. [2019-12-27 06:19:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164066 to 164066. [2019-12-27 06:19:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164066 states. [2019-12-27 06:19:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164066 states to 164066 states and 788968 transitions. [2019-12-27 06:19:26,558 INFO L78 Accepts]: Start accepts. Automaton has 164066 states and 788968 transitions. Word has length 7 [2019-12-27 06:19:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:26,559 INFO L462 AbstractCegarLoop]: Abstraction has 164066 states and 788968 transitions. [2019-12-27 06:19:26,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:19:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 164066 states and 788968 transitions. [2019-12-27 06:19:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:19:26,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:26,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:19:26,571 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:19:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1187468255, now seen corresponding path program 1 times [2019-12-27 06:19:26,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:26,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901736801] [2019-12-27 06:19:26,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:26,687 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 06:19:26,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901736801] [2019-12-27 06:19:26,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:26,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:26,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689057893] [2019-12-27 06:19:26,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:19:26,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:19:26,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:19:26,690 INFO L87 Difference]: Start difference. First operand 164066 states and 788968 transitions. Second operand 3 states. [2019-12-27 06:19:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:32,906 INFO L93 Difference]: Finished difference Result 103562 states and 449532 transitions. [2019-12-27 06:19:32,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:19:32,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:19:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:33,324 INFO L225 Difference]: With dead ends: 103562 [2019-12-27 06:19:33,324 INFO L226 Difference]: Without dead ends: 103562 [2019-12-27 06:19:33,325 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 06:19:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103562 states. [2019-12-27 06:19:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103562 to 103562. [2019-12-27 06:19:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103562 states. [2019-12-27 06:19:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103562 states to 103562 states and 449532 transitions. [2019-12-27 06:19:38,575 INFO L78 Accepts]: Start accepts. Automaton has 103562 states and 449532 transitions. Word has length 15 [2019-12-27 06:19:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:38,576 INFO L462 AbstractCegarLoop]: Abstraction has 103562 states and 449532 transitions. [2019-12-27 06:19:38,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:19:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 103562 states and 449532 transitions. [2019-12-27 06:19:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:19:38,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:38,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:19:38,579 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:19:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash -444517235, now seen corresponding path program 1 times [2019-12-27 06:19:38,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:38,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101714436] [2019-12-27 06:19:38,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:38,673 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 06:19:38,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101714436] [2019-12-27 06:19:38,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:38,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:38,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688987768] [2019-12-27 06:19:38,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:38,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:38,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:38,675 INFO L87 Difference]: Start difference. First operand 103562 states and 449532 transitions. Second operand 4 states. [2019-12-27 06:19:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:40,799 INFO L93 Difference]: Finished difference Result 160711 states and 667320 transitions. [2019-12-27 06:19:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:19:40,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:19:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:41,331 INFO L225 Difference]: With dead ends: 160711 [2019-12-27 06:19:41,331 INFO L226 Difference]: Without dead ends: 160592 [2019-12-27 06:19:41,331 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 06:19:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160592 states. [2019-12-27 06:19:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160592 to 146257. [2019-12-27 06:19:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146257 states. [2019-12-27 06:19:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146257 states to 146257 states and 614556 transitions. [2019-12-27 06:19:53,836 INFO L78 Accepts]: Start accepts. Automaton has 146257 states and 614556 transitions. Word has length 15 [2019-12-27 06:19:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:53,836 INFO L462 AbstractCegarLoop]: Abstraction has 146257 states and 614556 transitions. [2019-12-27 06:19:53,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 146257 states and 614556 transitions. [2019-12-27 06:19:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:19:53,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:53,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:19:53,840 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:19:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash -798602882, now seen corresponding path program 1 times [2019-12-27 06:19:53,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:53,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599430653] [2019-12-27 06:19:53,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:53,918 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 06:19:53,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599430653] [2019-12-27 06:19:53,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:53,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:19:53,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525875920] [2019-12-27 06:19:53,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:53,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:53,920 INFO L87 Difference]: Start difference. First operand 146257 states and 614556 transitions. Second operand 4 states. [2019-12-27 06:19:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:54,128 INFO L93 Difference]: Finished difference Result 39473 states and 140838 transitions. [2019-12-27 06:19:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:19:54,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:19:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:54,221 INFO L225 Difference]: With dead ends: 39473 [2019-12-27 06:19:54,222 INFO L226 Difference]: Without dead ends: 39473 [2019-12-27 06:19:54,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39473 states. [2019-12-27 06:19:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39473 to 39473. [2019-12-27 06:19:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39473 states. [2019-12-27 06:19:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39473 states to 39473 states and 140838 transitions. [2019-12-27 06:19:56,151 INFO L78 Accepts]: Start accepts. Automaton has 39473 states and 140838 transitions. Word has length 16 [2019-12-27 06:19:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:56,151 INFO L462 AbstractCegarLoop]: Abstraction has 39473 states and 140838 transitions. [2019-12-27 06:19:56,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 39473 states and 140838 transitions. [2019-12-27 06:19:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:19:56,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:56,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:19:56,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:19:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1050404483, now seen corresponding path program 1 times [2019-12-27 06:19:56,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:56,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170643758] [2019-12-27 06:19:56,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:56,222 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 06:19:56,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170643758] [2019-12-27 06:19:56,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:56,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:56,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599324768] [2019-12-27 06:19:56,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:56,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:56,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:56,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:56,224 INFO L87 Difference]: Start difference. First operand 39473 states and 140838 transitions. Second operand 4 states. [2019-12-27 06:19:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:56,614 INFO L93 Difference]: Finished difference Result 50748 states and 179051 transitions. [2019-12-27 06:19:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:19:56,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:19:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:56,718 INFO L225 Difference]: With dead ends: 50748 [2019-12-27 06:19:56,719 INFO L226 Difference]: Without dead ends: 50737 [2019-12-27 06:19:56,719 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 06:19:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50737 states. [2019-12-27 06:19:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50737 to 45038. [2019-12-27 06:19:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45038 states. [2019-12-27 06:19:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45038 states to 45038 states and 160086 transitions. [2019-12-27 06:19:58,726 INFO L78 Accepts]: Start accepts. Automaton has 45038 states and 160086 transitions. Word has length 16 [2019-12-27 06:19:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:58,726 INFO L462 AbstractCegarLoop]: Abstraction has 45038 states and 160086 transitions. [2019-12-27 06:19:58,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 45038 states and 160086 transitions. [2019-12-27 06:19:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:19:58,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:58,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:19:58,728 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:19:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1050284482, now seen corresponding path program 1 times [2019-12-27 06:19:58,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:58,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663770400] [2019-12-27 06:19:58,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:58,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 06:19:58,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663770400] [2019-12-27 06:19:58,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:58,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:58,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912186082] [2019-12-27 06:19:58,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:58,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:58,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:58,785 INFO L87 Difference]: Start difference. First operand 45038 states and 160086 transitions. Second operand 4 states. [2019-12-27 06:19:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:59,173 INFO L93 Difference]: Finished difference Result 54579 states and 192301 transitions. [2019-12-27 06:19:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:19:59,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:19:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:59,284 INFO L225 Difference]: With dead ends: 54579 [2019-12-27 06:19:59,284 INFO L226 Difference]: Without dead ends: 54568 [2019-12-27 06:19:59,285 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 06:19:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54568 states. [2019-12-27 06:20:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54568 to 44263. [2019-12-27 06:20:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44263 states. [2019-12-27 06:20:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44263 states to 44263 states and 157261 transitions. [2019-12-27 06:20:01,404 INFO L78 Accepts]: Start accepts. Automaton has 44263 states and 157261 transitions. Word has length 16 [2019-12-27 06:20:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:01,404 INFO L462 AbstractCegarLoop]: Abstraction has 44263 states and 157261 transitions. [2019-12-27 06:20:01,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:20:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 44263 states and 157261 transitions. [2019-12-27 06:20:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:20:01,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:01,421 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] [2019-12-27 06:20:01,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:01,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1735803470, now seen corresponding path program 1 times [2019-12-27 06:20:01,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:01,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619034236] [2019-12-27 06:20:01,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:01,522 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 06:20:01,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619034236] [2019-12-27 06:20:01,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:01,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:20:01,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005295293] [2019-12-27 06:20:01,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:20:01,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:01,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:20:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:20:01,525 INFO L87 Difference]: Start difference. First operand 44263 states and 157261 transitions. Second operand 5 states. [2019-12-27 06:20:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:02,172 INFO L93 Difference]: Finished difference Result 64369 states and 224813 transitions. [2019-12-27 06:20:02,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:20:02,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 06:20:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:02,320 INFO L225 Difference]: With dead ends: 64369 [2019-12-27 06:20:02,321 INFO L226 Difference]: Without dead ends: 64346 [2019-12-27 06:20:02,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:20:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64346 states. [2019-12-27 06:20:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64346 to 47079. [2019-12-27 06:20:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47079 states. [2019-12-27 06:20:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47079 states to 47079 states and 167291 transitions. [2019-12-27 06:20:06,569 INFO L78 Accepts]: Start accepts. Automaton has 47079 states and 167291 transitions. Word has length 24 [2019-12-27 06:20:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:06,569 INFO L462 AbstractCegarLoop]: Abstraction has 47079 states and 167291 transitions. [2019-12-27 06:20:06,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:20:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 47079 states and 167291 transitions. [2019-12-27 06:20:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:20:06,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:06,583 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] [2019-12-27 06:20:06,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1241237007, now seen corresponding path program 1 times [2019-12-27 06:20:06,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:06,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112011009] [2019-12-27 06:20:06,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:06,647 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 06:20:06,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112011009] [2019-12-27 06:20:06,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:06,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:20:06,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686875002] [2019-12-27 06:20:06,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:20:06,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:06,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:20:06,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:20:06,650 INFO L87 Difference]: Start difference. First operand 47079 states and 167291 transitions. Second operand 5 states. [2019-12-27 06:20:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:07,293 INFO L93 Difference]: Finished difference Result 66062 states and 230201 transitions. [2019-12-27 06:20:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:20:07,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 06:20:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:07,426 INFO L225 Difference]: With dead ends: 66062 [2019-12-27 06:20:07,426 INFO L226 Difference]: Without dead ends: 66039 [2019-12-27 06:20:07,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:20:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66039 states. [2019-12-27 06:20:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66039 to 43165. [2019-12-27 06:20:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43165 states. [2019-12-27 06:20:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43165 states to 43165 states and 153089 transitions. [2019-12-27 06:20:08,813 INFO L78 Accepts]: Start accepts. Automaton has 43165 states and 153089 transitions. Word has length 24 [2019-12-27 06:20:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:08,813 INFO L462 AbstractCegarLoop]: Abstraction has 43165 states and 153089 transitions. [2019-12-27 06:20:08,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:20:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 43165 states and 153089 transitions. [2019-12-27 06:20:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:20:08,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:08,834 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 06:20:08,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:08,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:08,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2135952936, now seen corresponding path program 1 times [2019-12-27 06:20:08,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:08,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411035761] [2019-12-27 06:20:08,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:08,899 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 06:20:08,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411035761] [2019-12-27 06:20:08,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:08,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:20:08,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442861860] [2019-12-27 06:20:08,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:20:08,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:20:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:20:08,903 INFO L87 Difference]: Start difference. First operand 43165 states and 153089 transitions. Second operand 5 states. [2019-12-27 06:20:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:09,033 INFO L93 Difference]: Finished difference Result 22104 states and 79422 transitions. [2019-12-27 06:20:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:20:09,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:20:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:09,074 INFO L225 Difference]: With dead ends: 22104 [2019-12-27 06:20:09,074 INFO L226 Difference]: Without dead ends: 22104 [2019-12-27 06:20:09,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:20:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-27 06:20:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 21800. [2019-12-27 06:20:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21800 states. [2019-12-27 06:20:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21800 states to 21800 states and 78390 transitions. [2019-12-27 06:20:09,469 INFO L78 Accepts]: Start accepts. Automaton has 21800 states and 78390 transitions. Word has length 28 [2019-12-27 06:20:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:09,469 INFO L462 AbstractCegarLoop]: Abstraction has 21800 states and 78390 transitions. [2019-12-27 06:20:09,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:20:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21800 states and 78390 transitions. [2019-12-27 06:20:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:20:09,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:09,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:20:09,507 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1861342996, now seen corresponding path program 1 times [2019-12-27 06:20:09,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:09,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311316119] [2019-12-27 06:20:09,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:09,583 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 06:20:09,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311316119] [2019-12-27 06:20:09,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:09,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:20:09,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707686782] [2019-12-27 06:20:09,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:20:09,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:09,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:20:09,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:20:09,585 INFO L87 Difference]: Start difference. First operand 21800 states and 78390 transitions. Second operand 4 states. [2019-12-27 06:20:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:10,139 INFO L93 Difference]: Finished difference Result 31588 states and 108507 transitions. [2019-12-27 06:20:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:20:10,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 06:20:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:10,210 INFO L225 Difference]: With dead ends: 31588 [2019-12-27 06:20:10,210 INFO L226 Difference]: Without dead ends: 22114 [2019-12-27 06:20:10,210 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 06:20:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22114 states. [2019-12-27 06:20:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22114 to 22018. [2019-12-27 06:20:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22018 states. [2019-12-27 06:20:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22018 states to 22018 states and 78252 transitions. [2019-12-27 06:20:10,749 INFO L78 Accepts]: Start accepts. Automaton has 22018 states and 78252 transitions. Word has length 42 [2019-12-27 06:20:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:10,749 INFO L462 AbstractCegarLoop]: Abstraction has 22018 states and 78252 transitions. [2019-12-27 06:20:10,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:20:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22018 states and 78252 transitions. [2019-12-27 06:20:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:20:10,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:10,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:20:10,787 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash 405367934, now seen corresponding path program 2 times [2019-12-27 06:20:10,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:10,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303756008] [2019-12-27 06:20:10,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:10,879 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 06:20:10,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303756008] [2019-12-27 06:20:10,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:10,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:20:10,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53657816] [2019-12-27 06:20:10,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:20:10,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:10,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:20:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:20:10,881 INFO L87 Difference]: Start difference. First operand 22018 states and 78252 transitions. Second operand 5 states. [2019-12-27 06:20:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:11,538 INFO L93 Difference]: Finished difference Result 33051 states and 116345 transitions. [2019-12-27 06:20:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:20:11,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 06:20:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:11,600 INFO L225 Difference]: With dead ends: 33051 [2019-12-27 06:20:11,601 INFO L226 Difference]: Without dead ends: 33051 [2019-12-27 06:20:11,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:20:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33051 states. [2019-12-27 06:20:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33051 to 29418. [2019-12-27 06:20:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29418 states. [2019-12-27 06:20:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29418 states to 29418 states and 104572 transitions. [2019-12-27 06:20:12,473 INFO L78 Accepts]: Start accepts. Automaton has 29418 states and 104572 transitions. Word has length 42 [2019-12-27 06:20:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:12,474 INFO L462 AbstractCegarLoop]: Abstraction has 29418 states and 104572 transitions. [2019-12-27 06:20:12,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:20:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 29418 states and 104572 transitions. [2019-12-27 06:20:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:20:12,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:12,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:20:12,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash 843263448, now seen corresponding path program 3 times [2019-12-27 06:20:12,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:12,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850481971] [2019-12-27 06:20:12,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:12,620 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 06:20:12,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850481971] [2019-12-27 06:20:12,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:12,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:20:12,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150325789] [2019-12-27 06:20:12,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:20:12,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:20:12,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:20:12,622 INFO L87 Difference]: Start difference. First operand 29418 states and 104572 transitions. Second operand 6 states. [2019-12-27 06:20:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:13,641 INFO L93 Difference]: Finished difference Result 54816 states and 194597 transitions. [2019-12-27 06:20:13,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:20:13,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 06:20:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:13,754 INFO L225 Difference]: With dead ends: 54816 [2019-12-27 06:20:13,754 INFO L226 Difference]: Without dead ends: 54816 [2019-12-27 06:20:13,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:20:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54816 states. [2019-12-27 06:20:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54816 to 32980. [2019-12-27 06:20:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32980 states. [2019-12-27 06:20:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32980 states to 32980 states and 117707 transitions. [2019-12-27 06:20:14,523 INFO L78 Accepts]: Start accepts. Automaton has 32980 states and 117707 transitions. Word has length 42 [2019-12-27 06:20:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:14,524 INFO L462 AbstractCegarLoop]: Abstraction has 32980 states and 117707 transitions. [2019-12-27 06:20:14,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:20:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32980 states and 117707 transitions. [2019-12-27 06:20:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:20:14,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:14,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:20:14,588 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1009921150, now seen corresponding path program 4 times [2019-12-27 06:20:14,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:14,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712079181] [2019-12-27 06:20:14,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:14,938 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 06:20:14,956 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 06:20:14,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712079181] [2019-12-27 06:20:14,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:14,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:20:14,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549593490] [2019-12-27 06:20:14,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:20:14,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:20:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:20:14,961 INFO L87 Difference]: Start difference. First operand 32980 states and 117707 transitions. Second operand 6 states. [2019-12-27 06:20:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:15,143 INFO L93 Difference]: Finished difference Result 31557 states and 114077 transitions. [2019-12-27 06:20:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:20:15,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 06:20:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:15,201 INFO L225 Difference]: With dead ends: 31557 [2019-12-27 06:20:15,201 INFO L226 Difference]: Without dead ends: 29116 [2019-12-27 06:20:15,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:20:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29116 states. [2019-12-27 06:20:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29116 to 27666. [2019-12-27 06:20:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27666 states. [2019-12-27 06:20:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27666 states to 27666 states and 99914 transitions. [2019-12-27 06:20:15,710 INFO L78 Accepts]: Start accepts. Automaton has 27666 states and 99914 transitions. Word has length 42 [2019-12-27 06:20:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:15,710 INFO L462 AbstractCegarLoop]: Abstraction has 27666 states and 99914 transitions. [2019-12-27 06:20:15,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:20:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 27666 states and 99914 transitions. [2019-12-27 06:20:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:20:15,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:15,747 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] [2019-12-27 06:20:15,747 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash -876689685, now seen corresponding path program 1 times [2019-12-27 06:20:15,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:15,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516721062] [2019-12-27 06:20:15,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:15,868 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 06:20:15,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516721062] [2019-12-27 06:20:15,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:15,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:20:15,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985099844] [2019-12-27 06:20:15,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:20:15,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:20:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:20:15,870 INFO L87 Difference]: Start difference. First operand 27666 states and 99914 transitions. Second operand 4 states. [2019-12-27 06:20:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:16,056 INFO L93 Difference]: Finished difference Result 39758 states and 138200 transitions. [2019-12-27 06:20:16,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:20:16,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 06:20:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:16,075 INFO L225 Difference]: With dead ends: 39758 [2019-12-27 06:20:16,076 INFO L226 Difference]: Without dead ends: 13118 [2019-12-27 06:20:16,076 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 06:20:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2019-12-27 06:20:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 13118. [2019-12-27 06:20:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13118 states. [2019-12-27 06:20:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13118 states to 13118 states and 41184 transitions. [2019-12-27 06:20:16,271 INFO L78 Accepts]: Start accepts. Automaton has 13118 states and 41184 transitions. Word has length 57 [2019-12-27 06:20:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:16,271 INFO L462 AbstractCegarLoop]: Abstraction has 13118 states and 41184 transitions. [2019-12-27 06:20:16,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:20:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13118 states and 41184 transitions. [2019-12-27 06:20:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:20:16,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:16,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:20:16,286 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2087731073, now seen corresponding path program 2 times [2019-12-27 06:20:16,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:16,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025454922] [2019-12-27 06:20:16,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:16,368 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 06:20:16,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025454922] [2019-12-27 06:20:16,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:16,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:20:16,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564259561] [2019-12-27 06:20:16,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:20:16,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:20:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:20:16,370 INFO L87 Difference]: Start difference. First operand 13118 states and 41184 transitions. Second operand 7 states. [2019-12-27 06:20:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:16,997 INFO L93 Difference]: Finished difference Result 35392 states and 110617 transitions. [2019-12-27 06:20:16,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:20:16,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:20:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:17,037 INFO L225 Difference]: With dead ends: 35392 [2019-12-27 06:20:17,037 INFO L226 Difference]: Without dead ends: 26216 [2019-12-27 06:20:17,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:20:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26216 states. [2019-12-27 06:20:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26216 to 15816. [2019-12-27 06:20:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15816 states. [2019-12-27 06:20:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15816 states to 15816 states and 49526 transitions. [2019-12-27 06:20:17,368 INFO L78 Accepts]: Start accepts. Automaton has 15816 states and 49526 transitions. Word has length 57 [2019-12-27 06:20:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:17,368 INFO L462 AbstractCegarLoop]: Abstraction has 15816 states and 49526 transitions. [2019-12-27 06:20:17,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:20:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15816 states and 49526 transitions. [2019-12-27 06:20:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:20:17,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:17,385 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] [2019-12-27 06:20:17,385 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1765059873, now seen corresponding path program 3 times [2019-12-27 06:20:17,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:17,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224504371] [2019-12-27 06:20:17,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:17,476 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 06:20:17,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224504371] [2019-12-27 06:20:17,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:17,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:20:17,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957140267] [2019-12-27 06:20:17,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:20:17,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:17,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:20:17,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:20:17,479 INFO L87 Difference]: Start difference. First operand 15816 states and 49526 transitions. Second operand 7 states. [2019-12-27 06:20:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:17,885 INFO L93 Difference]: Finished difference Result 39768 states and 122709 transitions. [2019-12-27 06:20:17,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:20:17,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:20:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:17,928 INFO L225 Difference]: With dead ends: 39768 [2019-12-27 06:20:17,929 INFO L226 Difference]: Without dead ends: 27952 [2019-12-27 06:20:17,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:20:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27952 states. [2019-12-27 06:20:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27952 to 18428. [2019-12-27 06:20:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18428 states. [2019-12-27 06:20:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 57481 transitions. [2019-12-27 06:20:18,298 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 57481 transitions. Word has length 57 [2019-12-27 06:20:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:18,298 INFO L462 AbstractCegarLoop]: Abstraction has 18428 states and 57481 transitions. [2019-12-27 06:20:18,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:20:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 57481 transitions. [2019-12-27 06:20:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:20:18,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:18,319 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] [2019-12-27 06:20:18,320 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:18,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1957634753, now seen corresponding path program 4 times [2019-12-27 06:20:18,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:18,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649988969] [2019-12-27 06:20:18,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:20:18,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649988969] [2019-12-27 06:20:18,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:18,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:20:18,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477859920] [2019-12-27 06:20:18,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:20:18,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:20:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:20:18,450 INFO L87 Difference]: Start difference. First operand 18428 states and 57481 transitions. Second operand 9 states. [2019-12-27 06:20:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:20,663 INFO L93 Difference]: Finished difference Result 122014 states and 390197 transitions. [2019-12-27 06:20:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 06:20:20,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 06:20:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:20,844 INFO L225 Difference]: With dead ends: 122014 [2019-12-27 06:20:20,844 INFO L226 Difference]: Without dead ends: 101290 [2019-12-27 06:20:20,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 06:20:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101290 states. [2019-12-27 06:20:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101290 to 26568. [2019-12-27 06:20:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26568 states. [2019-12-27 06:20:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26568 states to 26568 states and 84420 transitions. [2019-12-27 06:20:22,176 INFO L78 Accepts]: Start accepts. Automaton has 26568 states and 84420 transitions. Word has length 57 [2019-12-27 06:20:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:22,176 INFO L462 AbstractCegarLoop]: Abstraction has 26568 states and 84420 transitions. [2019-12-27 06:20:22,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:20:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 26568 states and 84420 transitions. [2019-12-27 06:20:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:20:22,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:22,207 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] [2019-12-27 06:20:22,208 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash -972735375, now seen corresponding path program 5 times [2019-12-27 06:20:22,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:22,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171574897] [2019-12-27 06:20:22,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:22,330 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 06:20:22,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171574897] [2019-12-27 06:20:22,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:22,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:20:22,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536284964] [2019-12-27 06:20:22,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:20:22,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:22,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:20:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:20:22,332 INFO L87 Difference]: Start difference. First operand 26568 states and 84420 transitions. Second operand 9 states. [2019-12-27 06:20:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:24,216 INFO L93 Difference]: Finished difference Result 112445 states and 354239 transitions. [2019-12-27 06:20:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 06:20:24,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 06:20:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:24,392 INFO L225 Difference]: With dead ends: 112445 [2019-12-27 06:20:24,392 INFO L226 Difference]: Without dead ends: 96549 [2019-12-27 06:20:24,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 06:20:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96549 states. [2019-12-27 06:20:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96549 to 26192. [2019-12-27 06:20:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26192 states. [2019-12-27 06:20:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26192 states to 26192 states and 83194 transitions. [2019-12-27 06:20:27,765 INFO L78 Accepts]: Start accepts. Automaton has 26192 states and 83194 transitions. Word has length 57 [2019-12-27 06:20:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:27,765 INFO L462 AbstractCegarLoop]: Abstraction has 26192 states and 83194 transitions. [2019-12-27 06:20:27,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:20:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 26192 states and 83194 transitions. [2019-12-27 06:20:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:20:27,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:27,797 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] [2019-12-27 06:20:27,798 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1404679823, now seen corresponding path program 6 times [2019-12-27 06:20:27,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:27,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725334841] [2019-12-27 06:20:27,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:27,871 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 06:20:27,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725334841] [2019-12-27 06:20:27,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:27,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:20:27,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737055080] [2019-12-27 06:20:27,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:20:27,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:20:27,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:20:27,873 INFO L87 Difference]: Start difference. First operand 26192 states and 83194 transitions. Second operand 3 states. [2019-12-27 06:20:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:27,976 INFO L93 Difference]: Finished difference Result 21773 states and 67963 transitions. [2019-12-27 06:20:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:20:27,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 06:20:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:28,030 INFO L225 Difference]: With dead ends: 21773 [2019-12-27 06:20:28,031 INFO L226 Difference]: Without dead ends: 21773 [2019-12-27 06:20:28,031 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 06:20:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21773 states. [2019-12-27 06:20:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21773 to 20869. [2019-12-27 06:20:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20869 states. [2019-12-27 06:20:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20869 states to 20869 states and 64864 transitions. [2019-12-27 06:20:28,567 INFO L78 Accepts]: Start accepts. Automaton has 20869 states and 64864 transitions. Word has length 57 [2019-12-27 06:20:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:28,568 INFO L462 AbstractCegarLoop]: Abstraction has 20869 states and 64864 transitions. [2019-12-27 06:20:28,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:20:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20869 states and 64864 transitions. [2019-12-27 06:20:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:28,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:28,594 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] [2019-12-27 06:20:28,594 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:28,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2094949333, now seen corresponding path program 1 times [2019-12-27 06:20:28,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:28,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101409965] [2019-12-27 06:20:28,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:28,861 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 06:20:28,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101409965] [2019-12-27 06:20:28,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:28,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:20:28,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860784797] [2019-12-27 06:20:28,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:20:28,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:28,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:20:28,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:20:28,863 INFO L87 Difference]: Start difference. First operand 20869 states and 64864 transitions. Second operand 11 states. [2019-12-27 06:20:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:30,203 INFO L93 Difference]: Finished difference Result 42810 states and 132872 transitions. [2019-12-27 06:20:30,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:20:30,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 06:20:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:30,264 INFO L225 Difference]: With dead ends: 42810 [2019-12-27 06:20:30,265 INFO L226 Difference]: Without dead ends: 41780 [2019-12-27 06:20:30,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:20:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41780 states. [2019-12-27 06:20:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41780 to 26692. [2019-12-27 06:20:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26692 states. [2019-12-27 06:20:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26692 states to 26692 states and 82779 transitions. [2019-12-27 06:20:30,806 INFO L78 Accepts]: Start accepts. Automaton has 26692 states and 82779 transitions. Word has length 58 [2019-12-27 06:20:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:30,806 INFO L462 AbstractCegarLoop]: Abstraction has 26692 states and 82779 transitions. [2019-12-27 06:20:30,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:20:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26692 states and 82779 transitions. [2019-12-27 06:20:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:30,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:30,837 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] [2019-12-27 06:20:30,837 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash 528069611, now seen corresponding path program 2 times [2019-12-27 06:20:30,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:30,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421439369] [2019-12-27 06:20:30,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:31,380 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 06:20:31,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421439369] [2019-12-27 06:20:31,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:31,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 06:20:31,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290498901] [2019-12-27 06:20:31,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 06:20:31,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:31,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 06:20:31,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:20:31,387 INFO L87 Difference]: Start difference. First operand 26692 states and 82779 transitions. Second operand 16 states. [2019-12-27 06:20:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:35,050 INFO L93 Difference]: Finished difference Result 41433 states and 127414 transitions. [2019-12-27 06:20:35,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 06:20:35,050 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-12-27 06:20:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:35,107 INFO L225 Difference]: With dead ends: 41433 [2019-12-27 06:20:35,108 INFO L226 Difference]: Without dead ends: 37492 [2019-12-27 06:20:35,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=456, Invalid=1800, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 06:20:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37492 states. [2019-12-27 06:20:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37492 to 27212. [2019-12-27 06:20:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27212 states. [2019-12-27 06:20:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27212 states to 27212 states and 84199 transitions. [2019-12-27 06:20:35,587 INFO L78 Accepts]: Start accepts. Automaton has 27212 states and 84199 transitions. Word has length 58 [2019-12-27 06:20:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:35,587 INFO L462 AbstractCegarLoop]: Abstraction has 27212 states and 84199 transitions. [2019-12-27 06:20:35,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 06:20:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 27212 states and 84199 transitions. [2019-12-27 06:20:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:35,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:35,618 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] [2019-12-27 06:20:35,618 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1074993369, now seen corresponding path program 3 times [2019-12-27 06:20:35,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:35,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140353670] [2019-12-27 06:20:35,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:35,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 06:20:35,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140353670] [2019-12-27 06:20:35,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:35,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:20:35,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780177986] [2019-12-27 06:20:35,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:20:35,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:20:35,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:20:35,714 INFO L87 Difference]: Start difference. First operand 27212 states and 84199 transitions. Second operand 7 states. [2019-12-27 06:20:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:37,184 INFO L93 Difference]: Finished difference Result 40477 states and 122607 transitions. [2019-12-27 06:20:37,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:20:37,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 06:20:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:37,246 INFO L225 Difference]: With dead ends: 40477 [2019-12-27 06:20:37,246 INFO L226 Difference]: Without dead ends: 40273 [2019-12-27 06:20:37,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:20:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40273 states. [2019-12-27 06:20:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40273 to 29512. [2019-12-27 06:20:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29512 states. [2019-12-27 06:20:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29512 states to 29512 states and 90875 transitions. [2019-12-27 06:20:38,065 INFO L78 Accepts]: Start accepts. Automaton has 29512 states and 90875 transitions. Word has length 58 [2019-12-27 06:20:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:38,065 INFO L462 AbstractCegarLoop]: Abstraction has 29512 states and 90875 transitions. [2019-12-27 06:20:38,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:20:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29512 states and 90875 transitions. [2019-12-27 06:20:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:38,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:38,099 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] [2019-12-27 06:20:38,099 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1589481730, now seen corresponding path program 1 times [2019-12-27 06:20:38,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:38,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325158983] [2019-12-27 06:20:38,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:38,133 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 06:20:38,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325158983] [2019-12-27 06:20:38,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:38,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:20:38,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369619782] [2019-12-27 06:20:38,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:20:38,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:20:38,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:20:38,135 INFO L87 Difference]: Start difference. First operand 29512 states and 90875 transitions. Second operand 3 states. [2019-12-27 06:20:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:38,302 INFO L93 Difference]: Finished difference Result 32574 states and 99358 transitions. [2019-12-27 06:20:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:20:38,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:20:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:38,352 INFO L225 Difference]: With dead ends: 32574 [2019-12-27 06:20:38,352 INFO L226 Difference]: Without dead ends: 32574 [2019-12-27 06:20:38,352 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 06:20:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32574 states. [2019-12-27 06:20:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32574 to 22826. [2019-12-27 06:20:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22826 states. [2019-12-27 06:20:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22826 states to 22826 states and 70143 transitions. [2019-12-27 06:20:38,759 INFO L78 Accepts]: Start accepts. Automaton has 22826 states and 70143 transitions. Word has length 58 [2019-12-27 06:20:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:38,759 INFO L462 AbstractCegarLoop]: Abstraction has 22826 states and 70143 transitions. [2019-12-27 06:20:38,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:20:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 22826 states and 70143 transitions. [2019-12-27 06:20:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:38,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:38,782 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] [2019-12-27 06:20:38,782 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:38,782 INFO L82 PathProgramCache]: Analyzing trace with hash -471376477, now seen corresponding path program 4 times [2019-12-27 06:20:38,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:38,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370098116] [2019-12-27 06:20:38,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:38,943 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 06:20:38,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370098116] [2019-12-27 06:20:38,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:38,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:20:38,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776998599] [2019-12-27 06:20:38,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:20:38,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:20:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:20:38,945 INFO L87 Difference]: Start difference. First operand 22826 states and 70143 transitions. Second operand 10 states. [2019-12-27 06:20:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:40,154 INFO L93 Difference]: Finished difference Result 29781 states and 91064 transitions. [2019-12-27 06:20:40,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:20:40,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 06:20:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:40,191 INFO L225 Difference]: With dead ends: 29781 [2019-12-27 06:20:40,191 INFO L226 Difference]: Without dead ends: 24798 [2019-12-27 06:20:40,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:20:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-27 06:20:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 21115. [2019-12-27 06:20:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21115 states. [2019-12-27 06:20:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 64446 transitions. [2019-12-27 06:20:40,785 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 64446 transitions. Word has length 58 [2019-12-27 06:20:40,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:40,785 INFO L462 AbstractCegarLoop]: Abstraction has 21115 states and 64446 transitions. [2019-12-27 06:20:40,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:20:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 64446 transitions. [2019-12-27 06:20:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:40,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:40,806 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] [2019-12-27 06:20:40,806 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1866943867, now seen corresponding path program 5 times [2019-12-27 06:20:40,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:40,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648476757] [2019-12-27 06:20:40,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:40,956 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 06:20:40,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648476757] [2019-12-27 06:20:40,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:40,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:20:40,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300671108] [2019-12-27 06:20:40,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:20:40,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:40,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:20:40,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:20:40,958 INFO L87 Difference]: Start difference. First operand 21115 states and 64446 transitions. Second operand 10 states. [2019-12-27 06:20:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:42,286 INFO L93 Difference]: Finished difference Result 28810 states and 86995 transitions. [2019-12-27 06:20:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:20:42,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 06:20:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:42,329 INFO L225 Difference]: With dead ends: 28810 [2019-12-27 06:20:42,329 INFO L226 Difference]: Without dead ends: 25380 [2019-12-27 06:20:42,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:20:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states. [2019-12-27 06:20:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 21119. [2019-12-27 06:20:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21119 states. [2019-12-27 06:20:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21119 states to 21119 states and 64195 transitions. [2019-12-27 06:20:42,694 INFO L78 Accepts]: Start accepts. Automaton has 21119 states and 64195 transitions. Word has length 58 [2019-12-27 06:20:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:42,694 INFO L462 AbstractCegarLoop]: Abstraction has 21119 states and 64195 transitions. [2019-12-27 06:20:42,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:20:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 21119 states and 64195 transitions. [2019-12-27 06:20:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:42,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:42,716 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] [2019-12-27 06:20:42,716 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:42,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1196949769, now seen corresponding path program 6 times [2019-12-27 06:20:42,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:42,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040520888] [2019-12-27 06:20:42,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:20:42,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040520888] [2019-12-27 06:20:42,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:42,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:20:42,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342317629] [2019-12-27 06:20:42,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:20:42,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:20:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:20:42,878 INFO L87 Difference]: Start difference. First operand 21119 states and 64195 transitions. Second operand 11 states. [2019-12-27 06:20:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:44,189 INFO L93 Difference]: Finished difference Result 27632 states and 83470 transitions. [2019-12-27 06:20:44,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:20:44,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 06:20:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:44,226 INFO L225 Difference]: With dead ends: 27632 [2019-12-27 06:20:44,227 INFO L226 Difference]: Without dead ends: 25097 [2019-12-27 06:20:44,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:20:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25097 states. [2019-12-27 06:20:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25097 to 20964. [2019-12-27 06:20:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20964 states. [2019-12-27 06:20:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20964 states to 20964 states and 63699 transitions. [2019-12-27 06:20:44,814 INFO L78 Accepts]: Start accepts. Automaton has 20964 states and 63699 transitions. Word has length 58 [2019-12-27 06:20:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:44,815 INFO L462 AbstractCegarLoop]: Abstraction has 20964 states and 63699 transitions. [2019-12-27 06:20:44,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:20:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 20964 states and 63699 transitions. [2019-12-27 06:20:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:20:44,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:44,838 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] [2019-12-27 06:20:44,838 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:44,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1456794055, now seen corresponding path program 7 times [2019-12-27 06:20:44,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:44,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034123434] [2019-12-27 06:20:44,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:44,889 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 06:20:44,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034123434] [2019-12-27 06:20:44,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:44,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:20:44,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022639980] [2019-12-27 06:20:44,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:20:44,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:20:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:20:44,891 INFO L87 Difference]: Start difference. First operand 20964 states and 63699 transitions. Second operand 3 states. [2019-12-27 06:20:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:44,985 INFO L93 Difference]: Finished difference Result 20962 states and 63694 transitions. [2019-12-27 06:20:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:20:44,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:20:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:45,026 INFO L225 Difference]: With dead ends: 20962 [2019-12-27 06:20:45,026 INFO L226 Difference]: Without dead ends: 20962 [2019-12-27 06:20:45,026 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 06:20:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20962 states. [2019-12-27 06:20:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20962 to 19148. [2019-12-27 06:20:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19148 states. [2019-12-27 06:20:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19148 states to 19148 states and 58844 transitions. [2019-12-27 06:20:45,544 INFO L78 Accepts]: Start accepts. Automaton has 19148 states and 58844 transitions. Word has length 58 [2019-12-27 06:20:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:45,544 INFO L462 AbstractCegarLoop]: Abstraction has 19148 states and 58844 transitions. [2019-12-27 06:20:45,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:20:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 19148 states and 58844 transitions. [2019-12-27 06:20:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:45,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:45,565 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] [2019-12-27 06:20:45,565 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash -766810440, now seen corresponding path program 1 times [2019-12-27 06:20:45,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:45,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100333066] [2019-12-27 06:20:45,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:46,087 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 06:20:46,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100333066] [2019-12-27 06:20:46,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:46,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:20:46,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122874684] [2019-12-27 06:20:46,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:20:46,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:20:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:20:46,089 INFO L87 Difference]: Start difference. First operand 19148 states and 58844 transitions. Second operand 17 states. [2019-12-27 06:20:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:49,246 INFO L93 Difference]: Finished difference Result 29491 states and 89105 transitions. [2019-12-27 06:20:49,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 06:20:49,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 06:20:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:49,289 INFO L225 Difference]: With dead ends: 29491 [2019-12-27 06:20:49,289 INFO L226 Difference]: Without dead ends: 28947 [2019-12-27 06:20:49,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 06:20:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28947 states. [2019-12-27 06:20:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28947 to 19256. [2019-12-27 06:20:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19256 states. [2019-12-27 06:20:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19256 states to 19256 states and 59115 transitions. [2019-12-27 06:20:49,877 INFO L78 Accepts]: Start accepts. Automaton has 19256 states and 59115 transitions. Word has length 59 [2019-12-27 06:20:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:49,878 INFO L462 AbstractCegarLoop]: Abstraction has 19256 states and 59115 transitions. [2019-12-27 06:20:49,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:20:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19256 states and 59115 transitions. [2019-12-27 06:20:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:49,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:49,899 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] [2019-12-27 06:20:49,899 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1378751924, now seen corresponding path program 2 times [2019-12-27 06:20:49,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:49,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508335459] [2019-12-27 06:20:49,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:50,115 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 06:20:50,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508335459] [2019-12-27 06:20:50,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:50,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:20:50,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507354681] [2019-12-27 06:20:50,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:20:50,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:50,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:20:50,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:20:50,116 INFO L87 Difference]: Start difference. First operand 19256 states and 59115 transitions. Second operand 11 states. [2019-12-27 06:20:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:50,968 INFO L93 Difference]: Finished difference Result 30104 states and 92346 transitions. [2019-12-27 06:20:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:20:50,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 06:20:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:51,004 INFO L225 Difference]: With dead ends: 30104 [2019-12-27 06:20:51,004 INFO L226 Difference]: Without dead ends: 24135 [2019-12-27 06:20:51,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:20:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24135 states. [2019-12-27 06:20:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24135 to 15362. [2019-12-27 06:20:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15362 states. [2019-12-27 06:20:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15362 states to 15362 states and 47362 transitions. [2019-12-27 06:20:51,328 INFO L78 Accepts]: Start accepts. Automaton has 15362 states and 47362 transitions. Word has length 59 [2019-12-27 06:20:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:51,328 INFO L462 AbstractCegarLoop]: Abstraction has 15362 states and 47362 transitions. [2019-12-27 06:20:51,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:20:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15362 states and 47362 transitions. [2019-12-27 06:20:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:51,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:51,347 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] [2019-12-27 06:20:51,347 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1697589252, now seen corresponding path program 3 times [2019-12-27 06:20:51,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:51,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590963501] [2019-12-27 06:20:51,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:51,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 06:20:51,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590963501] [2019-12-27 06:20:51,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:51,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:20:51,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570604644] [2019-12-27 06:20:51,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:20:51,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:20:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:20:51,550 INFO L87 Difference]: Start difference. First operand 15362 states and 47362 transitions. Second operand 11 states. [2019-12-27 06:20:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:52,621 INFO L93 Difference]: Finished difference Result 18549 states and 56972 transitions. [2019-12-27 06:20:52,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:20:52,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 06:20:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:52,650 INFO L225 Difference]: With dead ends: 18549 [2019-12-27 06:20:52,650 INFO L226 Difference]: Without dead ends: 18253 [2019-12-27 06:20:52,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:20:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18253 states. [2019-12-27 06:20:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18253 to 15216. [2019-12-27 06:20:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15216 states. [2019-12-27 06:20:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15216 states to 15216 states and 47000 transitions. [2019-12-27 06:20:53,166 INFO L78 Accepts]: Start accepts. Automaton has 15216 states and 47000 transitions. Word has length 59 [2019-12-27 06:20:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:53,167 INFO L462 AbstractCegarLoop]: Abstraction has 15216 states and 47000 transitions. [2019-12-27 06:20:53,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:20:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 15216 states and 47000 transitions. [2019-12-27 06:20:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:53,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:53,181 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] [2019-12-27 06:20:53,181 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:20:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:53,182 INFO L82 PathProgramCache]: Analyzing trace with hash 982633720, now seen corresponding path program 4 times [2019-12-27 06:20:53,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:53,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583907909] [2019-12-27 06:20:53,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:20:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:20:53,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:20:53,348 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:20:53,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~y$w_buff1~0_28) (= 0 v_~a~0_9) (= v_~x~0_11 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t957~0.base_18|) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$r_buff1_thd3~0_20) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p3_EAX~0_14) (= v_~y$w_buff0_used~0_109 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t957~0.base_18| 4) |v_#length_29|) (= v_~y$r_buff0_thd2~0_72 0) (= v_~b~0_11 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~y$r_buff1_thd1~0_11) (= |v_ULTIMATE.start_main_~#t957~0.offset_15| 0) (= v_~y$w_buff1_used~0_68 0) (= 0 v_~y$r_buff1_thd2~0_44) (= 0 v_~__unbuffered_cnt~0_24) (< 0 |v_#StackHeapBarrier_20|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t957~0.base_18|)) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_18| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_18|) |v_ULTIMATE.start_main_~#t957~0.offset_15| 0)) |v_#memory_int_27|) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t957~0.base_18| 1)) (= 0 v_~__unbuffered_p3_EBX~0_14) (= 0 |v_#NULL.base_3|) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~weak$$choice2~0_31) (= 0 v_~y$r_buff1_thd4~0_20) (= v_~y$r_buff0_thd3~0_29 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_22|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_17|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_8|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_20|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_72, ULTIMATE.start_main_~#t957~0.offset=|v_ULTIMATE.start_main_~#t957~0.offset_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_21|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_44, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t957~0.base=|v_ULTIMATE.start_main_~#t957~0.base_18|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t959~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t960~0.base, ULTIMATE.start_main_~#t960~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t957~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t958~0.offset, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t958~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t957~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:20:53,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L850-1-->L852: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t958~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t958~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t958~0.offset_11|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t958~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12|) |v_ULTIMATE.start_main_~#t958~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t958~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t958~0.offset] because there is no mapped edge [2019-12-27 06:20:53,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L852-1-->L854: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13| 1) |v_#valid_40|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t959~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t959~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t959~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13|) |v_ULTIMATE.start_main_~#t959~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t959~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_11|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_~#t959~0.base] because there is no mapped edge [2019-12-27 06:20:53,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~__unbuffered_p2_EAX~0_5 v_~z~0_6) (= v_~y$r_buff0_thd0~0_16 v_~y$r_buff1_thd0~0_12) (= v_~y$r_buff0_thd3~0_19 v_~y$r_buff1_thd3~0_13) (= v_~y$r_buff0_thd4~0_16 v_~y$r_buff1_thd4~0_14) (= v_~y$r_buff0_thd3~0_18 1) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff1_thd2~0_29) (= v_~y$r_buff1_thd1~0_5 v_~y$r_buff0_thd1~0_5) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_5, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_12} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:20:53,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t960~0.base_12|) (= |v_ULTIMATE.start_main_~#t960~0.offset_10| 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12|) |v_ULTIMATE.start_main_~#t960~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t960~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t960~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t960~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t960~0.offset] because there is no mapped edge [2019-12-27 06:20:53,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~b~0_5) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~b~0=v_~b~0_5, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:20:53,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1766902371 256))) (.cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out1766902371| |P3Thread1of1ForFork0_#t~ite33_Out1766902371|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1766902371 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In1766902371 |P3Thread1of1ForFork0_#t~ite32_Out1766902371|)) (and (not .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out1766902371| ~y$w_buff1~0_In1766902371) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1766902371, ~y$w_buff1~0=~y$w_buff1~0_In1766902371, ~y~0=~y~0_In1766902371, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766902371} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1766902371, ~y$w_buff1~0=~y$w_buff1~0_In1766902371, ~y~0=~y~0_In1766902371, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1766902371|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1766902371|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766902371} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 06:20:53,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-316083311 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-316083311 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out-316083311| ~y$w_buff0_used~0_In-316083311) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out-316083311| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-316083311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316083311} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-316083311, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316083311, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-316083311|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 06:20:53,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2063502164 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2063502164 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-2063502164| ~y$w_buff0_used~0_In-2063502164)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out-2063502164| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2063502164, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2063502164} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2063502164, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2063502164, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-2063502164|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 06:20:53,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1830346214 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In1830346214 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1830346214 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In1830346214 256) 0))) (or (and (= ~y$w_buff1_used~0_In1830346214 |P3Thread1of1ForFork0_#t~ite35_Out1830346214|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out1830346214|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1830346214, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1830346214, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1830346214, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1830346214} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1830346214, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1830346214, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1830346214, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1830346214|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1830346214} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 06:20:53,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-288861651 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-288861651 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-288861651 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-288861651 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-288861651|)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-288861651| ~y$w_buff1_used~0_In-288861651) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-288861651, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288861651, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-288861651, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288861651} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-288861651, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288861651, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-288861651, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-288861651|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288861651} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 06:20:53,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1820527528 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1820527528 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1820527528)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1820527528 ~y$r_buff0_thd3~0_Out-1820527528)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1820527528, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1820527528} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1820527528|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1820527528, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1820527528} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:20:53,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2038970272 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In2038970272 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2038970272 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In2038970272 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out2038970272| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out2038970272| ~y$r_buff1_thd3~0_In2038970272) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2038970272, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2038970272, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2038970272, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2038970272} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2038970272, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2038970272, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2038970272, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out2038970272|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2038970272} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 06:20:53,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_14) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:20:53,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2136429975 256) 0))) (or (and (= ~y$w_buff0~0_In-2136429975 |P1Thread1of1ForFork2_#t~ite9_Out-2136429975|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In-2136429975| |P1Thread1of1ForFork2_#t~ite8_Out-2136429975|)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2136429975| |P1Thread1of1ForFork2_#t~ite8_Out-2136429975|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2136429975 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-2136429975 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-2136429975 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-2136429975 256) 0) .cse1))) .cse0 (= ~y$w_buff0~0_In-2136429975 |P1Thread1of1ForFork2_#t~ite8_Out-2136429975|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2136429975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136429975, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-2136429975|, ~y$w_buff0~0=~y$w_buff0~0_In-2136429975, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2136429975, ~weak$$choice2~0=~weak$$choice2~0_In-2136429975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2136429975} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2136429975, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2136429975|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136429975, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2136429975|, ~y$w_buff0~0=~y$w_buff0~0_In-2136429975, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2136429975, ~weak$$choice2~0=~weak$$choice2~0_In-2136429975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2136429975} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:20:53,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1600953929 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out1600953929| |P1Thread1of1ForFork2_#t~ite12_Out1600953929|) (= |P1Thread1of1ForFork2_#t~ite11_Out1600953929| ~y$w_buff1~0_In1600953929) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1600953929 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1600953929 256))) (= 0 (mod ~y$w_buff0_used~0_In1600953929 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1600953929 256) 0))))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out1600953929| ~y$w_buff1~0_In1600953929) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In1600953929| |P1Thread1of1ForFork2_#t~ite11_Out1600953929|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1600953929, ~y$w_buff1~0=~y$w_buff1~0_In1600953929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1600953929, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1600953929, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1600953929|, ~weak$$choice2~0=~weak$$choice2~0_In1600953929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1600953929} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1600953929, ~y$w_buff1~0=~y$w_buff1~0_In1600953929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1600953929, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1600953929, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1600953929|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1600953929|, ~weak$$choice2~0=~weak$$choice2~0_In1600953929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1600953929} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:20:53,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_56 v_~y$r_buff0_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 06:20:53,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2132080097 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out-2132080097| ~y$r_buff1_thd2~0_In-2132080097) (= |P1Thread1of1ForFork2_#t~ite23_In-2132080097| |P1Thread1of1ForFork2_#t~ite23_Out-2132080097|)) (and (= |P1Thread1of1ForFork2_#t~ite24_Out-2132080097| |P1Thread1of1ForFork2_#t~ite23_Out-2132080097|) (= ~y$r_buff1_thd2~0_In-2132080097 |P1Thread1of1ForFork2_#t~ite23_Out-2132080097|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2132080097 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2132080097 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-2132080097 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-2132080097 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132080097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132080097, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132080097, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-2132080097|, ~weak$$choice2~0=~weak$$choice2~0_In-2132080097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132080097} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132080097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132080097, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132080097, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-2132080097|, ~weak$$choice2~0=~weak$$choice2~0_In-2132080097, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-2132080097|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132080097} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 06:20:53,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_17 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_17, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 06:20:53,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1294654038 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1294654038 256)))) (or (and (= ~y$r_buff0_thd4~0_In-1294654038 |P3Thread1of1ForFork0_#t~ite36_Out-1294654038|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1294654038|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1294654038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294654038} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1294654038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294654038, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1294654038|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 06:20:53,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1734649018 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In1734649018 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1734649018 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1734649018 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out1734649018|)) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork0_#t~ite37_Out1734649018| ~y$r_buff1_thd4~0_In1734649018) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1734649018, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1734649018, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1734649018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1734649018} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1734649018, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1734649018, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1734649018, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1734649018|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1734649018} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 06:20:53,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_15) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_15, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:20:53,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:20:53,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1513547133 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1513547133 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1513547133| ~y~0_In-1513547133)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1513547133| ~y$w_buff1~0_In-1513547133) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1513547133, ~y~0=~y~0_In-1513547133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1513547133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1513547133} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1513547133, ~y~0=~y~0_In-1513547133, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1513547133|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1513547133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1513547133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:20:53,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_16 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:20:53,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-470809631 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-470809631 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-470809631|)) (and (= |ULTIMATE.start_main_#t~ite44_Out-470809631| ~y$w_buff0_used~0_In-470809631) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-470809631, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-470809631} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-470809631, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-470809631, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-470809631|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:20:53,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In13054458 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In13054458 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In13054458 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In13054458 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out13054458| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out13054458| ~y$w_buff1_used~0_In13054458)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In13054458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In13054458, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In13054458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In13054458} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In13054458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In13054458, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In13054458, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out13054458|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In13054458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:20:53,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-447079254 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-447079254 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-447079254|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-447079254 |ULTIMATE.start_main_#t~ite46_Out-447079254|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-447079254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-447079254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-447079254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-447079254, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-447079254|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 06:20:53,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1843735004 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1843735004 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1843735004 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1843735004 256)))) (or (and (= ~y$r_buff1_thd0~0_In1843735004 |ULTIMATE.start_main_#t~ite47_Out1843735004|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out1843735004| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1843735004, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1843735004, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1843735004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843735004} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1843735004, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1843735004, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1843735004|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1843735004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843735004} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 06:20:53,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_12| v_~y$r_buff1_thd0~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:20:53,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:20:53 BasicIcfg [2019-12-27 06:20:53,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:20:53,527 INFO L168 Benchmark]: Toolchain (without parser) took 156509.91 ms. Allocated memory was 136.3 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 99.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 912.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:53,535 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:20:53,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.12 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 98.9 MB in the beginning and 152.3 MB in the end (delta: -53.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:53,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.68 ms. Allocated memory is still 199.2 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:53,536 INFO L168 Benchmark]: Boogie Preprocessor took 40.19 ms. Allocated memory is still 199.2 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:53,537 INFO L168 Benchmark]: RCFGBuilder took 875.97 ms. Allocated memory is still 199.2 MB. Free memory was 147.4 MB in the beginning and 97.8 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:53,537 INFO L168 Benchmark]: TraceAbstraction took 154705.35 ms. Allocated memory was 199.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 847.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:53,539 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.44 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.12 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 98.9 MB in the beginning and 152.3 MB in the end (delta: -53.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.68 ms. Allocated memory is still 199.2 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.19 ms. Allocated memory is still 199.2 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.97 ms. Allocated memory is still 199.2 MB. Free memory was 147.4 MB in the beginning and 97.8 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154705.35 ms. Allocated memory was 199.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 847.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 183 ProgramPointsBefore, 90 ProgramPointsAfterwards, 211 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6901 VarBasedMoverChecksPositive, 180 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 77566 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t957, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t958, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t959, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t960, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 154.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 46.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6672 SDtfs, 9843 SDslu, 24023 SDs, 0 SdLazy, 15845 SolverSat, 527 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 46 SyntacticMatches, 16 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2694 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177426occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 58.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 344975 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1282 ConstructedInterpolants, 0 QuantifiedInterpolants, 266247 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...