/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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:17:43,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:17:43,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:17:43,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:17:43,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:17:43,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:17:43,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:17:43,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:17:43,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:17:43,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:17:43,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:17:43,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:17:43,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:17:43,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:17:43,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:17:43,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:17:43,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:17:43,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:17:43,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:17:43,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:17:43,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:17:43,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:17:43,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:17:43,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:17:43,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:17:43,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:17:43,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:17:43,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:17:43,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:17:43,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:17:43,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:17:43,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:17:43,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:17:43,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:17:43,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:17:43,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:17:43,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:17:43,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:17:43,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:17:43,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:17:43,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:17:43,811 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:17:43,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:17:43,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:17:43,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:17:43,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:17:43,826 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:17:43,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:17:43,827 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:17:43,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:17:43,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:17:43,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:17:43,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:17:43,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:17:43,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:17:43,828 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:17:43,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:17:43,828 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:17:43,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:17:43,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:17:43,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:17:43,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:17:43,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:17:43,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:17:43,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:17:43,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:17:43,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:17:43,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:17:43,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:17:43,831 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:17:43,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:17:43,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:17:44,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:17:44,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:17:44,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:17:44,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:17:44,139 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:17:44,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-27 06:17:44,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21161fd23/acc55b0c7ff4494ba5a903d63c441a90/FLAG7497a8b17 [2019-12-27 06:17:44,821 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:17:44,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-27 06:17:44,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21161fd23/acc55b0c7ff4494ba5a903d63c441a90/FLAG7497a8b17 [2019-12-27 06:17:45,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21161fd23/acc55b0c7ff4494ba5a903d63c441a90 [2019-12-27 06:17:45,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:17:45,101 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:17:45,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:17:45,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:17:45,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:17:45,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:17:45" (1/1) ... [2019-12-27 06:17:45,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66648c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:45, skipping insertion in model container [2019-12-27 06:17:45,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:17:45" (1/1) ... [2019-12-27 06:17:45,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:17:45,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:17:45,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:17:45,798 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:17:45,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:17:46,012 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:17:46,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46 WrapperNode [2019-12-27 06:17:46,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:17:46,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:17:46,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:17:46,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:17:46,022 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:17:46" (1/1) ... [2019-12-27 06:17:46,043 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:17:46" (1/1) ... [2019-12-27 06:17:46,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:17:46,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:17:46,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:17:46,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:17:46,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (1/1) ... [2019-12-27 06:17:46,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (1/1) ... [2019-12-27 06:17:46,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (1/1) ... [2019-12-27 06:17:46,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (1/1) ... [2019-12-27 06:17:46,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (1/1) ... [2019-12-27 06:17:46,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (1/1) ... [2019-12-27 06:17:46,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (1/1) ... [2019-12-27 06:17:46,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:17:46,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:17:46,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:17:46,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:17:46,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (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:17:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:17:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:17:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:17:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:17:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:17:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:17:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:17:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:17:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:17:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:17:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:17:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:17:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:17:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:17:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:17:46,189 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:17:46,975 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:17:46,975 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:17:46,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:17:46 BoogieIcfgContainer [2019-12-27 06:17:46,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:17:46,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:17:46,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:17:46,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:17:46,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:17:45" (1/3) ... [2019-12-27 06:17:46,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ec1b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:17:46, skipping insertion in model container [2019-12-27 06:17:46,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:17:46" (2/3) ... [2019-12-27 06:17:46,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ec1b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:17:46, skipping insertion in model container [2019-12-27 06:17:46,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:17:46" (3/3) ... [2019-12-27 06:17:46,986 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_power.opt.i [2019-12-27 06:17:46,997 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:17:46,997 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:17:47,005 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:17:47,006 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:17:47,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,048 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,048 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,117 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,117 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,117 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,118 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,119 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,119 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,119 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,119 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,120 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,120 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,120 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,120 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,120 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,121 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,121 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,121 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,121 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,121 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,122 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,122 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,122 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,122 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,122 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,122 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,128 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,129 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,137 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,143 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:17:47,159 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:17:47,179 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:17:47,179 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:17:47,179 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:17:47,179 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:17:47,180 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:17:47,180 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:17:47,180 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:17:47,180 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:17:47,197 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-27 06:17:47,199 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 06:17:47,335 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 06:17:47,335 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:17:47,356 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:17:47,378 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 06:17:47,439 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 06:17:47,440 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:17:47,450 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:17:47,472 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 06:17:47,473 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:17:51,078 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:17:51,204 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:17:51,604 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-27 06:17:51,749 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-27 06:17:51,771 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77566 [2019-12-27 06:17:51,771 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-27 06:17:51,775 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 06:18:27,839 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 177426 states. [2019-12-27 06:18:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 177426 states. [2019-12-27 06:18:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:18:27,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:27,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:27,849 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:18:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:27,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1556658876, now seen corresponding path program 1 times [2019-12-27 06:18:27,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:27,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424786908] [2019-12-27 06:18:27,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:28,113 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:18:28,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424786908] [2019-12-27 06:18:28,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:28,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:18:28,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037159026] [2019-12-27 06:18:28,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:28,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:28,137 INFO L87 Difference]: Start difference. First operand 177426 states. Second operand 3 states. [2019-12-27 06:18:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:33,654 INFO L93 Difference]: Finished difference Result 174206 states and 838758 transitions. [2019-12-27 06:18:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:33,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:18:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:34,632 INFO L225 Difference]: With dead ends: 174206 [2019-12-27 06:18:34,633 INFO L226 Difference]: Without dead ends: 164066 [2019-12-27 06:18:34,634 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:18:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164066 states. [2019-12-27 06:18:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164066 to 164066. [2019-12-27 06:18:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164066 states. [2019-12-27 06:18:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164066 states to 164066 states and 788968 transitions. [2019-12-27 06:18:53,135 INFO L78 Accepts]: Start accepts. Automaton has 164066 states and 788968 transitions. Word has length 7 [2019-12-27 06:18:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:53,136 INFO L462 AbstractCegarLoop]: Abstraction has 164066 states and 788968 transitions. [2019-12-27 06:18:53,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 164066 states and 788968 transitions. [2019-12-27 06:18:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:18:53,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:53,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:53,149 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:18:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1187468255, now seen corresponding path program 1 times [2019-12-27 06:18:53,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:53,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629764261] [2019-12-27 06:18:53,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:53,251 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:18:53,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629764261] [2019-12-27 06:18:53,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:53,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:53,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650137872] [2019-12-27 06:18:53,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:53,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:53,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:53,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:53,259 INFO L87 Difference]: Start difference. First operand 164066 states and 788968 transitions. Second operand 3 states. [2019-12-27 06:18:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:54,073 INFO L93 Difference]: Finished difference Result 103562 states and 449532 transitions. [2019-12-27 06:18:54,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:54,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:18:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:54,488 INFO L225 Difference]: With dead ends: 103562 [2019-12-27 06:18:54,489 INFO L226 Difference]: Without dead ends: 103562 [2019-12-27 06:18:54,489 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:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103562 states. [2019-12-27 06:19:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103562 to 103562. [2019-12-27 06:19:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103562 states. [2019-12-27 06:19:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103562 states to 103562 states and 449532 transitions. [2019-12-27 06:19:05,918 INFO L78 Accepts]: Start accepts. Automaton has 103562 states and 449532 transitions. Word has length 15 [2019-12-27 06:19:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:05,918 INFO L462 AbstractCegarLoop]: Abstraction has 103562 states and 449532 transitions. [2019-12-27 06:19:05,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:19:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 103562 states and 449532 transitions. [2019-12-27 06:19:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:19:05,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:05,921 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:05,921 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:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash -444517235, now seen corresponding path program 1 times [2019-12-27 06:19:05,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:05,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974648317] [2019-12-27 06:19:05,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:06,002 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:06,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974648317] [2019-12-27 06:19:06,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:06,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:06,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306133044] [2019-12-27 06:19:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:06,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:06,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:06,004 INFO L87 Difference]: Start difference. First operand 103562 states and 449532 transitions. Second operand 4 states. [2019-12-27 06:19:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:07,054 INFO L93 Difference]: Finished difference Result 160711 states and 667320 transitions. [2019-12-27 06:19:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:19:07,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:19:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:13,238 INFO L225 Difference]: With dead ends: 160711 [2019-12-27 06:19:13,239 INFO L226 Difference]: Without dead ends: 160592 [2019-12-27 06:19:13,239 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:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160592 states. [2019-12-27 06:19:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160592 to 146257. [2019-12-27 06:19:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146257 states. [2019-12-27 06:19:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146257 states to 146257 states and 614556 transitions. [2019-12-27 06:19:21,556 INFO L78 Accepts]: Start accepts. Automaton has 146257 states and 614556 transitions. Word has length 15 [2019-12-27 06:19:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:21,557 INFO L462 AbstractCegarLoop]: Abstraction has 146257 states and 614556 transitions. [2019-12-27 06:19:21,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 146257 states and 614556 transitions. [2019-12-27 06:19:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:19:21,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:21,561 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:21,561 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:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash -798602882, now seen corresponding path program 1 times [2019-12-27 06:19:21,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:21,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941454045] [2019-12-27 06:19:21,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:21,656 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:21,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941454045] [2019-12-27 06:19:21,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:21,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:19:21,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007407859] [2019-12-27 06:19:21,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:21,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:21,658 INFO L87 Difference]: Start difference. First operand 146257 states and 614556 transitions. Second operand 4 states. [2019-12-27 06:19:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:21,856 INFO L93 Difference]: Finished difference Result 39473 states and 140838 transitions. [2019-12-27 06:19:21,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:19:21,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:19:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:21,936 INFO L225 Difference]: With dead ends: 39473 [2019-12-27 06:19:21,936 INFO L226 Difference]: Without dead ends: 39473 [2019-12-27 06:19:21,937 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:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39473 states. [2019-12-27 06:19:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39473 to 39473. [2019-12-27 06:19:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39473 states. [2019-12-27 06:19:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39473 states to 39473 states and 140838 transitions. [2019-12-27 06:19:22,789 INFO L78 Accepts]: Start accepts. Automaton has 39473 states and 140838 transitions. Word has length 16 [2019-12-27 06:19:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:22,789 INFO L462 AbstractCegarLoop]: Abstraction has 39473 states and 140838 transitions. [2019-12-27 06:19:22,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 39473 states and 140838 transitions. [2019-12-27 06:19:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:19:22,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:22,793 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:22,793 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:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1050404483, now seen corresponding path program 1 times [2019-12-27 06:19:22,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:22,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760739990] [2019-12-27 06:19:22,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:22,864 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:22,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760739990] [2019-12-27 06:19:22,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:22,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:22,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506160078] [2019-12-27 06:19:22,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:22,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:22,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:22,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:22,866 INFO L87 Difference]: Start difference. First operand 39473 states and 140838 transitions. Second operand 4 states. [2019-12-27 06:19:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:23,322 INFO L93 Difference]: Finished difference Result 50748 states and 179051 transitions. [2019-12-27 06:19:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:19:23,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:19:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:23,428 INFO L225 Difference]: With dead ends: 50748 [2019-12-27 06:19:23,428 INFO L226 Difference]: Without dead ends: 50737 [2019-12-27 06:19:23,429 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:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50737 states. [2019-12-27 06:19:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50737 to 45038. [2019-12-27 06:19:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45038 states. [2019-12-27 06:19:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45038 states to 45038 states and 160086 transitions. [2019-12-27 06:19:24,737 INFO L78 Accepts]: Start accepts. Automaton has 45038 states and 160086 transitions. Word has length 16 [2019-12-27 06:19:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:24,737 INFO L462 AbstractCegarLoop]: Abstraction has 45038 states and 160086 transitions. [2019-12-27 06:19:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 45038 states and 160086 transitions. [2019-12-27 06:19:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:19:24,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:24,740 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:24,740 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:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1050284482, now seen corresponding path program 1 times [2019-12-27 06:19:24,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:24,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732573623] [2019-12-27 06:19:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:24,800 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:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732573623] [2019-12-27 06:19:24,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:24,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:24,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587470484] [2019-12-27 06:19:24,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:24,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:24,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:24,802 INFO L87 Difference]: Start difference. First operand 45038 states and 160086 transitions. Second operand 4 states. [2019-12-27 06:19:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:25,211 INFO L93 Difference]: Finished difference Result 54579 states and 192301 transitions. [2019-12-27 06:19:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:19:25,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:19:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:25,324 INFO L225 Difference]: With dead ends: 54579 [2019-12-27 06:19:25,325 INFO L226 Difference]: Without dead ends: 54568 [2019-12-27 06:19:25,325 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:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54568 states. [2019-12-27 06:19:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54568 to 44263. [2019-12-27 06:19:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44263 states. [2019-12-27 06:19:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44263 states to 44263 states and 157261 transitions. [2019-12-27 06:19:26,704 INFO L78 Accepts]: Start accepts. Automaton has 44263 states and 157261 transitions. Word has length 16 [2019-12-27 06:19:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:26,704 INFO L462 AbstractCegarLoop]: Abstraction has 44263 states and 157261 transitions. [2019-12-27 06:19:26,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 44263 states and 157261 transitions. [2019-12-27 06:19:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:19:26,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:26,721 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:19:26,722 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:19:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1735803470, now seen corresponding path program 1 times [2019-12-27 06:19:26,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:26,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205528322] [2019-12-27 06:19:26,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:19:26,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205528322] [2019-12-27 06:19:26,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:26,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:19:26,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998693905] [2019-12-27 06:19:26,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:19:26,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:26,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:19:26,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:19:26,801 INFO L87 Difference]: Start difference. First operand 44263 states and 157261 transitions. Second operand 5 states. [2019-12-27 06:19:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:27,479 INFO L93 Difference]: Finished difference Result 64369 states and 224813 transitions. [2019-12-27 06:19:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:19:27,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 06:19:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:27,615 INFO L225 Difference]: With dead ends: 64369 [2019-12-27 06:19:27,615 INFO L226 Difference]: Without dead ends: 64346 [2019-12-27 06:19:27,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:19:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64346 states. [2019-12-27 06:19:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64346 to 47079. [2019-12-27 06:19:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47079 states. [2019-12-27 06:19:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47079 states to 47079 states and 167291 transitions. [2019-12-27 06:19:29,132 INFO L78 Accepts]: Start accepts. Automaton has 47079 states and 167291 transitions. Word has length 24 [2019-12-27 06:19:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:29,132 INFO L462 AbstractCegarLoop]: Abstraction has 47079 states and 167291 transitions. [2019-12-27 06:19:29,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:19:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 47079 states and 167291 transitions. [2019-12-27 06:19:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:19:29,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:29,145 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:19:29,146 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:19:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:29,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1241237007, now seen corresponding path program 1 times [2019-12-27 06:19:29,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:29,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565552689] [2019-12-27 06:19:29,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:29,211 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:29,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565552689] [2019-12-27 06:19:29,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:29,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:19:29,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386759655] [2019-12-27 06:19:29,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:19:29,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:19:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:19:29,214 INFO L87 Difference]: Start difference. First operand 47079 states and 167291 transitions. Second operand 5 states. [2019-12-27 06:19:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:29,893 INFO L93 Difference]: Finished difference Result 66062 states and 230201 transitions. [2019-12-27 06:19:29,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:19:29,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 06:19:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:30,032 INFO L225 Difference]: With dead ends: 66062 [2019-12-27 06:19:30,032 INFO L226 Difference]: Without dead ends: 66039 [2019-12-27 06:19:30,033 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:19:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66039 states. [2019-12-27 06:19:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66039 to 43165. [2019-12-27 06:19:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43165 states. [2019-12-27 06:19:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43165 states to 43165 states and 153089 transitions. [2019-12-27 06:19:31,547 INFO L78 Accepts]: Start accepts. Automaton has 43165 states and 153089 transitions. Word has length 24 [2019-12-27 06:19:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:31,548 INFO L462 AbstractCegarLoop]: Abstraction has 43165 states and 153089 transitions. [2019-12-27 06:19:31,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:19:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 43165 states and 153089 transitions. [2019-12-27 06:19:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:19:31,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:31,570 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:19:31,570 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:19:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2135952936, now seen corresponding path program 1 times [2019-12-27 06:19:31,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:31,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086851527] [2019-12-27 06:19:31,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:31,624 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:31,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086851527] [2019-12-27 06:19:31,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:31,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:19:31,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66319153] [2019-12-27 06:19:31,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:19:31,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:31,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:19:31,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:19:31,627 INFO L87 Difference]: Start difference. First operand 43165 states and 153089 transitions. Second operand 5 states. [2019-12-27 06:19:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:31,757 INFO L93 Difference]: Finished difference Result 22104 states and 79422 transitions. [2019-12-27 06:19:31,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:19:31,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:19:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:31,801 INFO L225 Difference]: With dead ends: 22104 [2019-12-27 06:19:31,801 INFO L226 Difference]: Without dead ends: 22104 [2019-12-27 06:19:31,802 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:19:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-27 06:19:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 21800. [2019-12-27 06:19:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21800 states. [2019-12-27 06:19:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21800 states to 21800 states and 78390 transitions. [2019-12-27 06:19:32,200 INFO L78 Accepts]: Start accepts. Automaton has 21800 states and 78390 transitions. Word has length 28 [2019-12-27 06:19:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:32,200 INFO L462 AbstractCegarLoop]: Abstraction has 21800 states and 78390 transitions. [2019-12-27 06:19:32,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:19:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 21800 states and 78390 transitions. [2019-12-27 06:19:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:19:32,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:32,239 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:19:32,239 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:19:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1861342996, now seen corresponding path program 1 times [2019-12-27 06:19:32,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:32,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153326093] [2019-12-27 06:19:32,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:32,311 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:32,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153326093] [2019-12-27 06:19:32,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:32,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:19:32,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871718896] [2019-12-27 06:19:32,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:32,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:32,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:32,313 INFO L87 Difference]: Start difference. First operand 21800 states and 78390 transitions. Second operand 4 states. [2019-12-27 06:19:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:32,508 INFO L93 Difference]: Finished difference Result 31588 states and 108507 transitions. [2019-12-27 06:19:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:19:32,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 06:19:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:32,576 INFO L225 Difference]: With dead ends: 31588 [2019-12-27 06:19:32,576 INFO L226 Difference]: Without dead ends: 22114 [2019-12-27 06:19:32,577 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:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22114 states. [2019-12-27 06:19:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22114 to 22018. [2019-12-27 06:19:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22018 states. [2019-12-27 06:19:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22018 states to 22018 states and 78252 transitions. [2019-12-27 06:19:33,412 INFO L78 Accepts]: Start accepts. Automaton has 22018 states and 78252 transitions. Word has length 42 [2019-12-27 06:19:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:33,413 INFO L462 AbstractCegarLoop]: Abstraction has 22018 states and 78252 transitions. [2019-12-27 06:19:33,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 22018 states and 78252 transitions. [2019-12-27 06:19:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:19:33,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:33,451 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:19:33,451 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:19:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 405367934, now seen corresponding path program 2 times [2019-12-27 06:19:33,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:33,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191088685] [2019-12-27 06:19:33,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:19:33,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191088685] [2019-12-27 06:19:33,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:33,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:19:33,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503214571] [2019-12-27 06:19:33,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:19:33,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:33,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:19:33,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:19:33,522 INFO L87 Difference]: Start difference. First operand 22018 states and 78252 transitions. Second operand 6 states. [2019-12-27 06:19:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:33,697 INFO L93 Difference]: Finished difference Result 20676 states and 74842 transitions. [2019-12-27 06:19:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:19:33,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 06:19:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:33,762 INFO L225 Difference]: With dead ends: 20676 [2019-12-27 06:19:33,762 INFO L226 Difference]: Without dead ends: 18829 [2019-12-27 06:19:33,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:19:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18829 states. [2019-12-27 06:19:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18829 to 17981. [2019-12-27 06:19:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17981 states. [2019-12-27 06:19:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17981 states to 17981 states and 65223 transitions. [2019-12-27 06:19:34,239 INFO L78 Accepts]: Start accepts. Automaton has 17981 states and 65223 transitions. Word has length 42 [2019-12-27 06:19:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:34,239 INFO L462 AbstractCegarLoop]: Abstraction has 17981 states and 65223 transitions. [2019-12-27 06:19:34,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:19:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17981 states and 65223 transitions. [2019-12-27 06:19:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:19:34,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:34,268 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:19:34,269 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:19:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1684532697, now seen corresponding path program 1 times [2019-12-27 06:19:34,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:34,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642853290] [2019-12-27 06:19:34,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:19:34,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642853290] [2019-12-27 06:19:34,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:34,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:19:34,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241761290] [2019-12-27 06:19:34,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:19:34,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:19:34,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:19:34,344 INFO L87 Difference]: Start difference. First operand 17981 states and 65223 transitions. Second operand 4 states. [2019-12-27 06:19:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:34,487 INFO L93 Difference]: Finished difference Result 25903 states and 90377 transitions. [2019-12-27 06:19:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:19:34,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 06:19:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:34,502 INFO L225 Difference]: With dead ends: 25903 [2019-12-27 06:19:34,502 INFO L226 Difference]: Without dead ends: 8473 [2019-12-27 06:19:34,503 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:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8473 states. [2019-12-27 06:19:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8473 to 8473. [2019-12-27 06:19:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8473 states. [2019-12-27 06:19:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8473 states to 8473 states and 26713 transitions. [2019-12-27 06:19:34,634 INFO L78 Accepts]: Start accepts. Automaton has 8473 states and 26713 transitions. Word has length 57 [2019-12-27 06:19:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:34,634 INFO L462 AbstractCegarLoop]: Abstraction has 8473 states and 26713 transitions. [2019-12-27 06:19:34,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:19:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 8473 states and 26713 transitions. [2019-12-27 06:19:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:19:34,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:34,644 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:19:34,644 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:19:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash -710246511, now seen corresponding path program 2 times [2019-12-27 06:19:34,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:34,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460859345] [2019-12-27 06:19:34,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:34,731 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:34,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460859345] [2019-12-27 06:19:34,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:34,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:19:34,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500797305] [2019-12-27 06:19:34,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:19:34,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:19:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:19:34,733 INFO L87 Difference]: Start difference. First operand 8473 states and 26713 transitions. Second operand 7 states. [2019-12-27 06:19:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:35,131 INFO L93 Difference]: Finished difference Result 23527 states and 74268 transitions. [2019-12-27 06:19:35,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:19:35,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:19:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:35,169 INFO L225 Difference]: With dead ends: 23527 [2019-12-27 06:19:35,169 INFO L226 Difference]: Without dead ends: 17959 [2019-12-27 06:19:35,170 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:19:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17959 states. [2019-12-27 06:19:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17959 to 10609. [2019-12-27 06:19:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10609 states. [2019-12-27 06:19:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10609 states to 10609 states and 33720 transitions. [2019-12-27 06:19:35,502 INFO L78 Accepts]: Start accepts. Automaton has 10609 states and 33720 transitions. Word has length 57 [2019-12-27 06:19:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:35,502 INFO L462 AbstractCegarLoop]: Abstraction has 10609 states and 33720 transitions. [2019-12-27 06:19:35,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:19:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 10609 states and 33720 transitions. [2019-12-27 06:19:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:19:35,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:35,522 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:19:35,522 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:19:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash -417360961, now seen corresponding path program 3 times [2019-12-27 06:19:35,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:35,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935727137] [2019-12-27 06:19:35,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:19:35,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935727137] [2019-12-27 06:19:35,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:35,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:19:35,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648919631] [2019-12-27 06:19:35,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:19:35,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:19:35,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:19:35,641 INFO L87 Difference]: Start difference. First operand 10609 states and 33720 transitions. Second operand 7 states. [2019-12-27 06:19:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:36,349 INFO L93 Difference]: Finished difference Result 29160 states and 90983 transitions. [2019-12-27 06:19:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:19:36,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:19:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:36,401 INFO L225 Difference]: With dead ends: 29160 [2019-12-27 06:19:36,401 INFO L226 Difference]: Without dead ends: 20669 [2019-12-27 06:19:36,403 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:19:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20669 states. [2019-12-27 06:19:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20669 to 13166. [2019-12-27 06:19:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13166 states. [2019-12-27 06:19:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13166 states to 13166 states and 41783 transitions. [2019-12-27 06:19:36,799 INFO L78 Accepts]: Start accepts. Automaton has 13166 states and 41783 transitions. Word has length 57 [2019-12-27 06:19:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:36,799 INFO L462 AbstractCegarLoop]: Abstraction has 13166 states and 41783 transitions. [2019-12-27 06:19:36,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:19:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13166 states and 41783 transitions. [2019-12-27 06:19:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:19:36,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:36,821 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:19:36,821 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:19:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1532130975, now seen corresponding path program 4 times [2019-12-27 06:19:36,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:36,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078154252] [2019-12-27 06:19:36,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:36,967 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:36,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078154252] [2019-12-27 06:19:36,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:36,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:19:36,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783134761] [2019-12-27 06:19:36,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:19:36,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:36,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:19:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:19:36,969 INFO L87 Difference]: Start difference. First operand 13166 states and 41783 transitions. Second operand 9 states. [2019-12-27 06:19:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:39,061 INFO L93 Difference]: Finished difference Result 84351 states and 272691 transitions. [2019-12-27 06:19:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 06:19:39,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 06:19:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:39,194 INFO L225 Difference]: With dead ends: 84351 [2019-12-27 06:19:39,194 INFO L226 Difference]: Without dead ends: 69565 [2019-12-27 06:19:39,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 06:19:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69565 states. [2019-12-27 06:19:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69565 to 18751. [2019-12-27 06:19:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18751 states. [2019-12-27 06:19:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18751 states to 18751 states and 60469 transitions. [2019-12-27 06:19:39,915 INFO L78 Accepts]: Start accepts. Automaton has 18751 states and 60469 transitions. Word has length 57 [2019-12-27 06:19:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:39,915 INFO L462 AbstractCegarLoop]: Abstraction has 18751 states and 60469 transitions. [2019-12-27 06:19:39,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:19:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 18751 states and 60469 transitions. [2019-12-27 06:19:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:19:40,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:40,259 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:19:40,260 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:19:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2118129567, now seen corresponding path program 5 times [2019-12-27 06:19:40,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:40,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968156554] [2019-12-27 06:19:40,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:40,367 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:40,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968156554] [2019-12-27 06:19:40,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:40,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:19:40,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053825691] [2019-12-27 06:19:40,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:19:40,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:19:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:19:40,371 INFO L87 Difference]: Start difference. First operand 18751 states and 60469 transitions. Second operand 9 states. [2019-12-27 06:19:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:42,152 INFO L93 Difference]: Finished difference Result 77940 states and 248782 transitions. [2019-12-27 06:19:42,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 06:19:42,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 06:19:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:42,275 INFO L225 Difference]: With dead ends: 77940 [2019-12-27 06:19:42,275 INFO L226 Difference]: Without dead ends: 68131 [2019-12-27 06:19:42,276 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:19:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68131 states. [2019-12-27 06:19:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68131 to 18392. [2019-12-27 06:19:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2019-12-27 06:19:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 59320 transitions. [2019-12-27 06:19:42,950 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 59320 transitions. Word has length 57 [2019-12-27 06:19:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:42,950 INFO L462 AbstractCegarLoop]: Abstraction has 18392 states and 59320 transitions. [2019-12-27 06:19:42,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:19:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 59320 transitions. [2019-12-27 06:19:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:19:42,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:42,972 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:19:42,972 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:19:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1404679823, now seen corresponding path program 6 times [2019-12-27 06:19:42,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:42,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721165933] [2019-12-27 06:19:42,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:19:43,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721165933] [2019-12-27 06:19:43,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:43,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:43,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270524784] [2019-12-27 06:19:43,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:19:43,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:43,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:19:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:19:43,049 INFO L87 Difference]: Start difference. First operand 18392 states and 59320 transitions. Second operand 3 states. [2019-12-27 06:19:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:43,131 INFO L93 Difference]: Finished difference Result 17138 states and 53973 transitions. [2019-12-27 06:19:43,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:19:43,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 06:19:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:43,165 INFO L225 Difference]: With dead ends: 17138 [2019-12-27 06:19:43,165 INFO L226 Difference]: Without dead ends: 17138 [2019-12-27 06:19:43,165 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:19:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17138 states. [2019-12-27 06:19:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17138 to 16452. [2019-12-27 06:19:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-27 06:19:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 51551 transitions. [2019-12-27 06:19:43,422 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 51551 transitions. Word has length 57 [2019-12-27 06:19:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:43,422 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 51551 transitions. [2019-12-27 06:19:43,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:19:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 51551 transitions. [2019-12-27 06:19:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:19:43,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:43,441 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:19:43,441 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:19:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2094949333, now seen corresponding path program 1 times [2019-12-27 06:19:43,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:43,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771822353] [2019-12-27 06:19:43,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:43,503 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:43,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771822353] [2019-12-27 06:19:43,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:43,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:19:43,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496531504] [2019-12-27 06:19:43,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:19:43,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:43,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:19:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:19:43,505 INFO L87 Difference]: Start difference. First operand 16452 states and 51551 transitions. Second operand 3 states. [2019-12-27 06:19:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:43,844 INFO L93 Difference]: Finished difference Result 16450 states and 51546 transitions. [2019-12-27 06:19:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:19:43,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:19:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:43,876 INFO L225 Difference]: With dead ends: 16450 [2019-12-27 06:19:43,876 INFO L226 Difference]: Without dead ends: 16450 [2019-12-27 06:19:43,876 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:19:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2019-12-27 06:19:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 15816. [2019-12-27 06:19:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15816 states. [2019-12-27 06:19:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15816 states to 15816 states and 49828 transitions. [2019-12-27 06:19:44,358 INFO L78 Accepts]: Start accepts. Automaton has 15816 states and 49828 transitions. Word has length 58 [2019-12-27 06:19:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:44,358 INFO L462 AbstractCegarLoop]: Abstraction has 15816 states and 49828 transitions. [2019-12-27 06:19:44,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:19:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 15816 states and 49828 transitions. [2019-12-27 06:19:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:19:44,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:44,395 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:19:44,395 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:19:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1974293044, now seen corresponding path program 1 times [2019-12-27 06:19:44,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:44,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209491987] [2019-12-27 06:19:44,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:44,992 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:44,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209491987] [2019-12-27 06:19:44,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:44,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 06:19:44,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327017549] [2019-12-27 06:19:44,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 06:19:44,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 06:19:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:19:44,994 INFO L87 Difference]: Start difference. First operand 15816 states and 49828 transitions. Second operand 16 states. [2019-12-27 06:19:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:49,297 INFO L93 Difference]: Finished difference Result 27779 states and 85982 transitions. [2019-12-27 06:19:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 06:19:49,298 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-27 06:19:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:49,335 INFO L225 Difference]: With dead ends: 27779 [2019-12-27 06:19:49,335 INFO L226 Difference]: Without dead ends: 23429 [2019-12-27 06:19:49,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=486, Invalid=2166, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 06:19:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23429 states. [2019-12-27 06:19:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23429 to 17505. [2019-12-27 06:19:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17505 states. [2019-12-27 06:19:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17505 states to 17505 states and 54714 transitions. [2019-12-27 06:19:49,651 INFO L78 Accepts]: Start accepts. Automaton has 17505 states and 54714 transitions. Word has length 59 [2019-12-27 06:19:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:49,651 INFO L462 AbstractCegarLoop]: Abstraction has 17505 states and 54714 transitions. [2019-12-27 06:19:49,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 06:19:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17505 states and 54714 transitions. [2019-12-27 06:19:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:19:49,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:49,681 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:19:49,681 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:19:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash -476019080, now seen corresponding path program 2 times [2019-12-27 06:19:49,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:49,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264485470] [2019-12-27 06:19:49,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:50,208 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:50,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264485470] [2019-12-27 06:19:50,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:50,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 06:19:50,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952675574] [2019-12-27 06:19:50,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 06:19:50,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 06:19:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:19:50,211 INFO L87 Difference]: Start difference. First operand 17505 states and 54714 transitions. Second operand 16 states. [2019-12-27 06:19:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:19:54,753 INFO L93 Difference]: Finished difference Result 30227 states and 93462 transitions. [2019-12-27 06:19:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 06:19:54,753 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-27 06:19:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:19:54,790 INFO L225 Difference]: With dead ends: 30227 [2019-12-27 06:19:54,791 INFO L226 Difference]: Without dead ends: 24382 [2019-12-27 06:19:54,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=376, Invalid=1786, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 06:19:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24382 states. [2019-12-27 06:19:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24382 to 18095. [2019-12-27 06:19:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18095 states. [2019-12-27 06:19:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18095 states to 18095 states and 56192 transitions. [2019-12-27 06:19:55,111 INFO L78 Accepts]: Start accepts. Automaton has 18095 states and 56192 transitions. Word has length 59 [2019-12-27 06:19:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:19:55,111 INFO L462 AbstractCegarLoop]: Abstraction has 18095 states and 56192 transitions. [2019-12-27 06:19:55,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 06:19:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18095 states and 56192 transitions. [2019-12-27 06:19:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:19:55,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:19:55,133 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:19:55,133 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:19:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:19:55,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1551913972, now seen corresponding path program 3 times [2019-12-27 06:19:55,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:19:55,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879706643] [2019-12-27 06:19:55,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:19:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:19:55,527 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:55,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879706643] [2019-12-27 06:19:55,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:19:55,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:19:55,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546123910] [2019-12-27 06:19:55,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:19:55,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:19:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:19:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:19:55,530 INFO L87 Difference]: Start difference. First operand 18095 states and 56192 transitions. Second operand 15 states. [2019-12-27 06:20:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:00,098 INFO L93 Difference]: Finished difference Result 36711 states and 113143 transitions. [2019-12-27 06:20:00,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 06:20:00,098 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-27 06:20:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:00,154 INFO L225 Difference]: With dead ends: 36711 [2019-12-27 06:20:00,155 INFO L226 Difference]: Without dead ends: 36025 [2019-12-27 06:20:00,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 06:20:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36025 states. [2019-12-27 06:20:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36025 to 21205. [2019-12-27 06:20:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21205 states. [2019-12-27 06:20:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21205 states to 21205 states and 65928 transitions. [2019-12-27 06:20:00,594 INFO L78 Accepts]: Start accepts. Automaton has 21205 states and 65928 transitions. Word has length 59 [2019-12-27 06:20:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:00,594 INFO L462 AbstractCegarLoop]: Abstraction has 21205 states and 65928 transitions. [2019-12-27 06:20:00,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:20:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 21205 states and 65928 transitions. [2019-12-27 06:20:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:00,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:00,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, 1] [2019-12-27 06:20:00,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:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:00,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1261122612, now seen corresponding path program 4 times [2019-12-27 06:20:00,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:00,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791579761] [2019-12-27 06:20:00,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:01,000 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,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791579761] [2019-12-27 06:20:01,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:01,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:20:01,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247301478] [2019-12-27 06:20:01,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:20:01,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:20:01,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:20:01,011 INFO L87 Difference]: Start difference. First operand 21205 states and 65928 transitions. Second operand 15 states. [2019-12-27 06:20:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:05,264 INFO L93 Difference]: Finished difference Result 36217 states and 111055 transitions. [2019-12-27 06:20:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 06:20:05,264 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-27 06:20:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:05,313 INFO L225 Difference]: With dead ends: 36217 [2019-12-27 06:20:05,313 INFO L226 Difference]: Without dead ends: 29894 [2019-12-27 06:20:05,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 06:20:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29894 states. [2019-12-27 06:20:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29894 to 17562. [2019-12-27 06:20:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17562 states. [2019-12-27 06:20:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17562 states to 17562 states and 54766 transitions. [2019-12-27 06:20:05,998 INFO L78 Accepts]: Start accepts. Automaton has 17562 states and 54766 transitions. Word has length 59 [2019-12-27 06:20:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:05,999 INFO L462 AbstractCegarLoop]: Abstraction has 17562 states and 54766 transitions. [2019-12-27 06:20:05,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:20:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 17562 states and 54766 transitions. [2019-12-27 06:20:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:06,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:06,021 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:06,022 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:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1669543284, now seen corresponding path program 5 times [2019-12-27 06:20:06,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:06,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6587336] [2019-12-27 06:20:06,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:06,587 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,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6587336] [2019-12-27 06:20:06,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:06,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:20:06,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865247704] [2019-12-27 06:20:06,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:20:06,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:20:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:20:06,589 INFO L87 Difference]: Start difference. First operand 17562 states and 54766 transitions. Second operand 17 states. [2019-12-27 06:20:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:10,573 INFO L93 Difference]: Finished difference Result 25527 states and 78909 transitions. [2019-12-27 06:20:10,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 06:20:10,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 06:20:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:10,610 INFO L225 Difference]: With dead ends: 25527 [2019-12-27 06:20:10,610 INFO L226 Difference]: Without dead ends: 23453 [2019-12-27 06:20:10,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1456, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 06:20:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23453 states. [2019-12-27 06:20:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23453 to 17844. [2019-12-27 06:20:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17844 states. [2019-12-27 06:20:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17844 states to 17844 states and 55517 transitions. [2019-12-27 06:20:10,923 INFO L78 Accepts]: Start accepts. Automaton has 17844 states and 55517 transitions. Word has length 59 [2019-12-27 06:20:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:10,923 INFO L462 AbstractCegarLoop]: Abstraction has 17844 states and 55517 transitions. [2019-12-27 06:20:10,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:20:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 17844 states and 55517 transitions. [2019-12-27 06:20:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:10,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:10,943 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:10,943 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:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash -597490960, now seen corresponding path program 6 times [2019-12-27 06:20:10,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:10,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268464530] [2019-12-27 06:20:10,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:11,455 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:11,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268464530] [2019-12-27 06:20:11,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:11,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:20:11,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125952127] [2019-12-27 06:20:11,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:20:11,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:20:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:20:11,457 INFO L87 Difference]: Start difference. First operand 17844 states and 55517 transitions. Second operand 17 states. [2019-12-27 06:20:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:16,498 INFO L93 Difference]: Finished difference Result 25329 states and 77994 transitions. [2019-12-27 06:20:16,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 06:20:16,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 06:20:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:16,536 INFO L225 Difference]: With dead ends: 25329 [2019-12-27 06:20:16,536 INFO L226 Difference]: Without dead ends: 23789 [2019-12-27 06:20:16,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 06:20:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23789 states. [2019-12-27 06:20:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23789 to 17790. [2019-12-27 06:20:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17790 states. [2019-12-27 06:20:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17790 states to 17790 states and 55364 transitions. [2019-12-27 06:20:16,855 INFO L78 Accepts]: Start accepts. Automaton has 17790 states and 55364 transitions. Word has length 59 [2019-12-27 06:20:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:16,855 INFO L462 AbstractCegarLoop]: Abstraction has 17790 states and 55364 transitions. [2019-12-27 06:20:16,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:20:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 17790 states and 55364 transitions. [2019-12-27 06:20:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:16,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:16,876 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:16,876 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:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:16,877 INFO L82 PathProgramCache]: Analyzing trace with hash 555844168, now seen corresponding path program 7 times [2019-12-27 06:20:16,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:16,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070221997] [2019-12-27 06:20:16,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:17,410 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,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070221997] [2019-12-27 06:20:17,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:17,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:20:17,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808519502] [2019-12-27 06:20:17,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:20:17,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:20:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:20:17,412 INFO L87 Difference]: Start difference. First operand 17790 states and 55364 transitions. Second operand 17 states. [2019-12-27 06:20:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:20,334 INFO L93 Difference]: Finished difference Result 24767 states and 76306 transitions. [2019-12-27 06:20:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 06:20:20,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 06:20:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:20,372 INFO L225 Difference]: With dead ends: 24767 [2019-12-27 06:20:20,372 INFO L226 Difference]: Without dead ends: 23773 [2019-12-27 06:20:20,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 06:20:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23773 states. [2019-12-27 06:20:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23773 to 17754. [2019-12-27 06:20:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17754 states. [2019-12-27 06:20:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17754 states to 17754 states and 55262 transitions. [2019-12-27 06:20:20,998 INFO L78 Accepts]: Start accepts. Automaton has 17754 states and 55262 transitions. Word has length 59 [2019-12-27 06:20:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:20,998 INFO L462 AbstractCegarLoop]: Abstraction has 17754 states and 55262 transitions. [2019-12-27 06:20:20,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:20:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17754 states and 55262 transitions. [2019-12-27 06:20:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:21,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:21,019 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:21,019 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:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1475667086, now seen corresponding path program 8 times [2019-12-27 06:20:21,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:21,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403120304] [2019-12-27 06:20:21,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:21,359 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:21,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403120304] [2019-12-27 06:20:21,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:21,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:20:21,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544364990] [2019-12-27 06:20:21,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:20:21,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:20:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:20:21,362 INFO L87 Difference]: Start difference. First operand 17754 states and 55262 transitions. Second operand 15 states. [2019-12-27 06:20:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:25,456 INFO L93 Difference]: Finished difference Result 31586 states and 97499 transitions. [2019-12-27 06:20:25,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 06:20:25,457 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-27 06:20:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:25,507 INFO L225 Difference]: With dead ends: 31586 [2019-12-27 06:20:25,508 INFO L226 Difference]: Without dead ends: 31348 [2019-12-27 06:20:25,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=405, Invalid=2145, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 06:20:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31348 states. [2019-12-27 06:20:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31348 to 19104. [2019-12-27 06:20:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19104 states. [2019-12-27 06:20:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19104 states to 19104 states and 59403 transitions. [2019-12-27 06:20:25,908 INFO L78 Accepts]: Start accepts. Automaton has 19104 states and 59403 transitions. Word has length 59 [2019-12-27 06:20:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:25,908 INFO L462 AbstractCegarLoop]: Abstraction has 19104 states and 59403 transitions. [2019-12-27 06:20:25,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:20:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19104 states and 59403 transitions. [2019-12-27 06:20:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:25,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:25,930 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:25,930 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:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:25,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1766458446, now seen corresponding path program 9 times [2019-12-27 06:20:25,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:25,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096457450] [2019-12-27 06:20:25,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:26,277 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:26,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096457450] [2019-12-27 06:20:26,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:26,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:20:26,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918380988] [2019-12-27 06:20:26,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:20:26,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:26,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:20:26,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:20:26,278 INFO L87 Difference]: Start difference. First operand 19104 states and 59403 transitions. Second operand 15 states. [2019-12-27 06:20:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:30,188 INFO L93 Difference]: Finished difference Result 31656 states and 97401 transitions. [2019-12-27 06:20:30,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 06:20:30,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-27 06:20:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:30,236 INFO L225 Difference]: With dead ends: 31656 [2019-12-27 06:20:30,236 INFO L226 Difference]: Without dead ends: 29938 [2019-12-27 06:20:30,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=420, Invalid=1932, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 06:20:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29938 states. [2019-12-27 06:20:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29938 to 17610. [2019-12-27 06:20:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17610 states. [2019-12-27 06:20:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17610 states to 17610 states and 54878 transitions. [2019-12-27 06:20:30,600 INFO L78 Accepts]: Start accepts. Automaton has 17610 states and 54878 transitions. Word has length 59 [2019-12-27 06:20:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:30,600 INFO L462 AbstractCegarLoop]: Abstraction has 17610 states and 54878 transitions. [2019-12-27 06:20:30,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:20:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 17610 states and 54878 transitions. [2019-12-27 06:20:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:30,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:30,621 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:30,621 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:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1971277882, now seen corresponding path program 10 times [2019-12-27 06:20:30,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:30,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617423054] [2019-12-27 06:20:30,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:30,773 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:30,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617423054] [2019-12-27 06:20:30,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:30,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:20:30,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678324590] [2019-12-27 06:20:30,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:20:30,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:20:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:20:30,775 INFO L87 Difference]: Start difference. First operand 17610 states and 54878 transitions. Second operand 10 states. [2019-12-27 06:20:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:32,008 INFO L93 Difference]: Finished difference Result 24850 states and 77377 transitions. [2019-12-27 06:20:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:20:32,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 06:20:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:32,041 INFO L225 Difference]: With dead ends: 24850 [2019-12-27 06:20:32,041 INFO L226 Difference]: Without dead ends: 21216 [2019-12-27 06:20:32,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:20:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21216 states. [2019-12-27 06:20:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21216 to 17768. [2019-12-27 06:20:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17768 states. [2019-12-27 06:20:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17768 states to 17768 states and 55294 transitions. [2019-12-27 06:20:32,335 INFO L78 Accepts]: Start accepts. Automaton has 17768 states and 55294 transitions. Word has length 59 [2019-12-27 06:20:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:32,335 INFO L462 AbstractCegarLoop]: Abstraction has 17768 states and 55294 transitions. [2019-12-27 06:20:32,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:20:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17768 states and 55294 transitions. [2019-12-27 06:20:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:32,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:32,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,356 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:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash -618081858, now seen corresponding path program 11 times [2019-12-27 06:20:32,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:32,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122616045] [2019-12-27 06:20:32,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:20:32,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122616045] [2019-12-27 06:20:32,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:32,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:20:32,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667211223] [2019-12-27 06:20:32,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:20:32,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:20:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:20:32,500 INFO L87 Difference]: Start difference. First operand 17768 states and 55294 transitions. Second operand 11 states. [2019-12-27 06:20:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:33,773 INFO L93 Difference]: Finished difference Result 23978 states and 74223 transitions. [2019-12-27 06:20:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:20:33,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 06:20:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:33,807 INFO L225 Difference]: With dead ends: 23978 [2019-12-27 06:20:33,807 INFO L226 Difference]: Without dead ends: 21382 [2019-12-27 06:20:33,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:20:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21382 states. [2019-12-27 06:20:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21382 to 17592. [2019-12-27 06:20:34,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17592 states. [2019-12-27 06:20:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17592 states to 17592 states and 54801 transitions. [2019-12-27 06:20:34,292 INFO L78 Accepts]: Start accepts. Automaton has 17592 states and 54801 transitions. Word has length 59 [2019-12-27 06:20:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:34,292 INFO L462 AbstractCegarLoop]: Abstraction has 17592 states and 54801 transitions. [2019-12-27 06:20:34,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:20:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17592 states and 54801 transitions. [2019-12-27 06:20:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:34,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:34,313 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:34,313 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:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1613078860, now seen corresponding path program 12 times [2019-12-27 06:20:34,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:34,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13188733] [2019-12-27 06:20:34,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:34,458 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:34,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13188733] [2019-12-27 06:20:34,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:34,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:20:34,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037679205] [2019-12-27 06:20:34,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:20:34,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:20:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:20:34,463 INFO L87 Difference]: Start difference. First operand 17592 states and 54801 transitions. Second operand 11 states. [2019-12-27 06:20:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:35,504 INFO L93 Difference]: Finished difference Result 30658 states and 95446 transitions. [2019-12-27 06:20:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:20:35,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 06:20:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:35,575 INFO L225 Difference]: With dead ends: 30658 [2019-12-27 06:20:35,575 INFO L226 Difference]: Without dead ends: 30092 [2019-12-27 06:20:35,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-27 06:20:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30092 states. [2019-12-27 06:20:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30092 to 19530. [2019-12-27 06:20:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19530 states. [2019-12-27 06:20:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 60784 transitions. [2019-12-27 06:20:35,993 INFO L78 Accepts]: Start accepts. Automaton has 19530 states and 60784 transitions. Word has length 59 [2019-12-27 06:20:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:35,993 INFO L462 AbstractCegarLoop]: Abstraction has 19530 states and 60784 transitions. [2019-12-27 06:20:35,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:20:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19530 states and 60784 transitions. [2019-12-27 06:20:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:36,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:36,017 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:36,017 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:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1903870220, now seen corresponding path program 13 times [2019-12-27 06:20:36,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:36,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169448067] [2019-12-27 06:20:36,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:20:36,192 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:36,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169448067] [2019-12-27 06:20:36,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:20:36,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:20:36,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141061455] [2019-12-27 06:20:36,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:20:36,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:20:36,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:20:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:20:36,194 INFO L87 Difference]: Start difference. First operand 19530 states and 60784 transitions. Second operand 11 states. [2019-12-27 06:20:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:20:37,219 INFO L93 Difference]: Finished difference Result 30444 states and 94333 transitions. [2019-12-27 06:20:37,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:20:37,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 06:20:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:20:37,261 INFO L225 Difference]: With dead ends: 30444 [2019-12-27 06:20:37,262 INFO L226 Difference]: Without dead ends: 26926 [2019-12-27 06:20:37,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:20:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26926 states. [2019-12-27 06:20:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26926 to 17184. [2019-12-27 06:20:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17184 states. [2019-12-27 06:20:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17184 states to 17184 states and 53578 transitions. [2019-12-27 06:20:37,596 INFO L78 Accepts]: Start accepts. Automaton has 17184 states and 53578 transitions. Word has length 59 [2019-12-27 06:20:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:20:37,596 INFO L462 AbstractCegarLoop]: Abstraction has 17184 states and 53578 transitions. [2019-12-27 06:20:37,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:20:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17184 states and 53578 transitions. [2019-12-27 06:20:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:20:37,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:20:37,617 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:37,617 INFO L410 AbstractCegarLoop]: === Iteration 32 === [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:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:20:37,618 INFO L82 PathProgramCache]: Analyzing trace with hash 982633720, now seen corresponding path program 14 times [2019-12-27 06:20:37,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:20:37,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857976339] [2019-12-27 06:20:37,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:20:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:20:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:20:37,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:20:37,748 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:20:37,753 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_~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) (= 0 |v_ULTIMATE.start_main_~#t941~0.offset_15|) (= v_~y$w_buff0_used~0_109 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_18| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_18|) |v_ULTIMATE.start_main_~#t941~0.offset_15| 0)) |v_#memory_int_27|) (= 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) (= (store .cse0 |v_ULTIMATE.start_main_~#t941~0.base_18| 1) |v_#valid_68|) (= (select .cse0 |v_ULTIMATE.start_main_~#t941~0.base_18|) 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|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t941~0.base_18|) (= 0 v_~__unbuffered_p3_EBX~0_14) (= 0 |v_#NULL.base_3|) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t941~0.base_18| 4)) (= 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|, ~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, ULTIMATE.start_main_~#t941~0.offset=|v_ULTIMATE.start_main_~#t941~0.offset_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ULTIMATE.start_main_~#t941~0.base=|v_ULTIMATE.start_main_~#t941~0.base_18|, ~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_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_20|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_8|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_22|, ~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_#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|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_17|, ~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_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_21|, 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, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_17|, ~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, ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_15|, ~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, ~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, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t941~0.offset, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t941~0.base, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t944~0.base, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t943~0.base, ~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_#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, ULTIMATE.start_main_~#t942~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t942~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t943~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t944~0.offset, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:20:37,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L850-1-->L852: Formula: (and (= |v_ULTIMATE.start_main_~#t942~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t942~0.base_12|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12|) |v_ULTIMATE.start_main_~#t942~0.offset_11| 1))) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t942~0.base_12| 4)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t942~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t942~0.offset, #length, ULTIMATE.start_main_~#t942~0.base] because there is no mapped edge [2019-12-27 06:20:37,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L852-1-->L854: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t943~0.base_13|)) (= |v_ULTIMATE.start_main_~#t943~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13|) |v_ULTIMATE.start_main_~#t943~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t943~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t943~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_11|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_13|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t943~0.offset, ULTIMATE.start_main_~#t943~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:20:37,760 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:37,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L854-1-->L856: Formula: (and (= |v_ULTIMATE.start_main_~#t944~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t944~0.base_12| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t944~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12|) |v_ULTIMATE.start_main_~#t944~0.offset_10| 3)) |v_#memory_int_21|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t944~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t944~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t944~0.base] because there is no mapped edge [2019-12-27 06:20:37,763 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:37,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-1658742535| |P3Thread1of1ForFork0_#t~ite32_Out-1658742535|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1658742535 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1658742535 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-1658742535 |P3Thread1of1ForFork0_#t~ite32_Out-1658742535|)) (and (= ~y~0_In-1658742535 |P3Thread1of1ForFork0_#t~ite32_Out-1658742535|) .cse1 (or .cse0 .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1658742535, ~y$w_buff1~0=~y$w_buff1~0_In-1658742535, ~y~0=~y~0_In-1658742535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658742535} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1658742535, ~y$w_buff1~0=~y$w_buff1~0_In-1658742535, ~y~0=~y~0_In-1658742535, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1658742535|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1658742535|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658742535} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 06:20:37,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2001683750 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-2001683750 256)))) (or (and (= ~y$w_buff0_used~0_In-2001683750 |P3Thread1of1ForFork0_#t~ite34_Out-2001683750|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-2001683750|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2001683750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2001683750} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2001683750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2001683750, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-2001683750|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 06:20:37,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1009051870 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1009051870 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1009051870| ~y$w_buff0_used~0_In-1009051870)) (and (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1009051870| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009051870, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1009051870} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009051870, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1009051870, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1009051870|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 06:20:37,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-882777905 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In-882777905 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-882777905 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In-882777905 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-882777905 |P3Thread1of1ForFork0_#t~ite35_Out-882777905|) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out-882777905| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-882777905, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-882777905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-882777905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882777905} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-882777905, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-882777905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-882777905, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-882777905|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882777905} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 06:20:37,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In934963392 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In934963392 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In934963392 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In934963392 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out934963392| ~y$w_buff1_used~0_In934963392)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out934963392| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In934963392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In934963392, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In934963392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934963392} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In934963392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In934963392, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In934963392, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out934963392|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934963392} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 06:20:37,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-991447936 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-991447936 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-991447936)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-991447936 ~y$r_buff0_thd3~0_Out-991447936)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-991447936, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-991447936} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-991447936|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-991447936, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-991447936} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:20:37,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In57095061 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In57095061 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In57095061 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In57095061 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In57095061 |P2Thread1of1ForFork3_#t~ite31_Out57095061|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork3_#t~ite31_Out57095061|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In57095061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In57095061, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In57095061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In57095061} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In57095061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In57095061, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In57095061, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out57095061|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In57095061} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 06:20:37,771 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:37,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-831173598 256)))) (or (and .cse0 (= ~y$w_buff0~0_In-831173598 |P1Thread1of1ForFork2_#t~ite8_Out-831173598|) (= |P1Thread1of1ForFork2_#t~ite9_Out-831173598| |P1Thread1of1ForFork2_#t~ite8_Out-831173598|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-831173598 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-831173598 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-831173598 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-831173598 256)) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-831173598| ~y$w_buff0~0_In-831173598) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In-831173598| |P1Thread1of1ForFork2_#t~ite8_Out-831173598|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831173598, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-831173598, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-831173598|, ~y$w_buff0~0=~y$w_buff0~0_In-831173598, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-831173598, ~weak$$choice2~0=~weak$$choice2~0_In-831173598, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831173598} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831173598, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-831173598|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-831173598, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-831173598|, ~y$w_buff0~0=~y$w_buff0~0_In-831173598, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-831173598, ~weak$$choice2~0=~weak$$choice2~0_In-831173598, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831173598} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:20:37,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In69278119 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_In69278119| |P1Thread1of1ForFork2_#t~ite11_Out69278119|) (= |P1Thread1of1ForFork2_#t~ite12_Out69278119| ~y$w_buff1~0_In69278119) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out69278119| ~y$w_buff1~0_In69278119) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In69278119 256) 0))) (or (= (mod ~y$w_buff0_used~0_In69278119 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In69278119 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In69278119 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork2_#t~ite12_Out69278119| |P1Thread1of1ForFork2_#t~ite11_Out69278119|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In69278119, ~y$w_buff1~0=~y$w_buff1~0_In69278119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In69278119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In69278119, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In69278119|, ~weak$$choice2~0=~weak$$choice2~0_In69278119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In69278119} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In69278119, ~y$w_buff1~0=~y$w_buff1~0_In69278119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In69278119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In69278119, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out69278119|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out69278119|, ~weak$$choice2~0=~weak$$choice2~0_In69278119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In69278119} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:20:37,779 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:37,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1319687621 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In1319687621| |P1Thread1of1ForFork2_#t~ite23_Out1319687621|) (= |P1Thread1of1ForFork2_#t~ite24_Out1319687621| ~y$r_buff1_thd2~0_In1319687621) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite23_Out1319687621| |P1Thread1of1ForFork2_#t~ite24_Out1319687621|) (= |P1Thread1of1ForFork2_#t~ite23_Out1319687621| ~y$r_buff1_thd2~0_In1319687621) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1319687621 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1319687621 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1319687621 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In1319687621 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1319687621, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1319687621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319687621, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1319687621|, ~weak$$choice2~0=~weak$$choice2~0_In1319687621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1319687621} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1319687621, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1319687621, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319687621, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1319687621|, ~weak$$choice2~0=~weak$$choice2~0_In1319687621, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1319687621|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1319687621} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 06:20:37,781 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:37,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1990067568 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1990067568 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-1990067568| ~y$r_buff0_thd4~0_In-1990067568)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-1990067568| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1990067568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990067568} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1990067568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990067568, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1990067568|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 06:20:37,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1028275741 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1028275741 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-1028275741 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1028275741 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-1028275741|)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-1028275741| ~y$r_buff1_thd4~0_In-1028275741) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1028275741, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1028275741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1028275741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1028275741} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1028275741, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1028275741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1028275741, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1028275741|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1028275741} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 06:20:37,784 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:37,784 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:37,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-891360385 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-891360385 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-891360385| ~y$w_buff1~0_In-891360385) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-891360385 |ULTIMATE.start_main_#t~ite42_Out-891360385|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-891360385, ~y~0=~y~0_In-891360385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-891360385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-891360385} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-891360385, ~y~0=~y~0_In-891360385, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-891360385|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-891360385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-891360385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:20:37,785 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:37,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In861535282 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In861535282 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out861535282| ~y$w_buff0_used~0_In861535282) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out861535282| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In861535282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In861535282} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In861535282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In861535282, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out861535282|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:20:37,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In669859139 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In669859139 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In669859139 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In669859139 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out669859139| ~y$w_buff1_used~0_In669859139)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out669859139|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In669859139, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In669859139, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In669859139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669859139} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In669859139, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In669859139, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In669859139, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out669859139|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669859139} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:20:37,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2122057419 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2122057419 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out2122057419|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2122057419 |ULTIMATE.start_main_#t~ite46_Out2122057419|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2122057419, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2122057419} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2122057419, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2122057419, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2122057419|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 06:20:37,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1488876821 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1488876821 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1488876821 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1488876821 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-1488876821|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1488876821 |ULTIMATE.start_main_#t~ite47_Out-1488876821|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1488876821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1488876821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1488876821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1488876821} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1488876821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1488876821, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1488876821|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1488876821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1488876821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 06:20:37,791 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:37,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:20:37 BasicIcfg [2019-12-27 06:20:37,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:20:37,913 INFO L168 Benchmark]: Toolchain (without parser) took 172811.56 ms. Allocated memory was 145.2 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 06:20:37,913 INFO L168 Benchmark]: CDTParser took 1.50 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:20:37,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.60 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 153.3 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:37,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:37,915 INFO L168 Benchmark]: Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 148.6 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:37,915 INFO L168 Benchmark]: RCFGBuilder took 858.11 ms. Allocated memory is still 202.4 MB. Free memory was 148.6 MB in the beginning and 98.8 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:20:37,922 INFO L168 Benchmark]: TraceAbstraction took 170932.82 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 06:20:37,924 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 911.60 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 153.3 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 148.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 858.11 ms. Allocated memory is still 202.4 MB. Free memory was 148.6 MB in the beginning and 98.8 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 170932.82 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. 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(&t941, ((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(&t942, ((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(&t943, ((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(&t944, ((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: 170.5s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 67.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8127 SDtfs, 14505 SDslu, 36577 SDs, 0 SdLazy, 37404 SolverSat, 829 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 30 SyntacticMatches, 40 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7475 ImplicationChecksByTransitivity, 12.1s 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: 54.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 297558 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1471 NumberOfCodeBlocks, 1471 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1381 ConstructedInterpolants, 0 QuantifiedInterpolants, 374525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...