/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:39:48,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:39:48,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:39:48,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:39:48,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:39:48,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:39:48,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:39:48,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:39:48,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:39:48,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:39:48,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:39:48,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:39:48,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:39:48,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:39:48,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:39:48,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:39:48,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:39:48,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:39:48,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:39:48,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:39:48,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:39:48,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:39:48,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:39:48,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:39:48,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:39:48,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:39:48,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:39:48,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:39:48,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:39:48,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:39:48,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:39:48,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:39:48,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:39:48,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:39:48,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:39:48,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:39:48,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:39:48,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:39:48,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:39:48,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:39:48,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:39:48,829 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-SemanticLbe-MCR.epf [2019-12-27 15:39:48,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:39:48,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:39:48,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:39:48,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:39:48,849 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:39:48,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:39:48,849 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:39:48,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:39:48,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:39:48,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:39:48,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:39:48,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:39:48,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:39:48,851 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:39:48,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:39:48,851 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:39:48,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:39:48,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:39:48,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:39:48,852 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:39:48,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:39:48,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:39:48,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:39:48,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:39:48,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:39:48,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:39:48,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:39:48,854 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:39:48,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:39:48,854 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:39:48,854 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:39:49,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:39:49,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:39:49,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:39:49,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:39:49,146 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:39:49,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-27 15:39:49,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f684f79/94d52e167f18409ead7a68bab5b8498f/FLAG71aa25038 [2019-12-27 15:39:49,801 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:39:49,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-27 15:39:49,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f684f79/94d52e167f18409ead7a68bab5b8498f/FLAG71aa25038 [2019-12-27 15:39:50,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f684f79/94d52e167f18409ead7a68bab5b8498f [2019-12-27 15:39:50,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:39:50,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:39:50,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:39:50,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:39:50,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:39:50,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50, skipping insertion in model container [2019-12-27 15:39:50,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:39:50,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:39:50,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:39:50,689 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:39:50,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:39:50,843 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:39:50,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50 WrapperNode [2019-12-27 15:39:50,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:39:50,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:39:50,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:39:50,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:39:50,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:39:50,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:39:50,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:39:50,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:39:50,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (1/1) ... [2019-12-27 15:39:50,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:39:50,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:39:50,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:39:50,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:39:50,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (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 15:39:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:39:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:39:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:39:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:39:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:39:51,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:39:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:39:51,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:39:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:39:51,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:39:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:39:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:39:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:39:51,050 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 15:39:51,989 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:39:51,990 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:39:51,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:39:51 BoogieIcfgContainer [2019-12-27 15:39:51,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:39:51,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:39:51,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:39:51,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:39:51,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:39:50" (1/3) ... [2019-12-27 15:39:51,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ca9fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:39:51, skipping insertion in model container [2019-12-27 15:39:51,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:50" (2/3) ... [2019-12-27 15:39:51,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ca9fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:39:51, skipping insertion in model container [2019-12-27 15:39:51,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:39:51" (3/3) ... [2019-12-27 15:39:52,000 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2019-12-27 15:39:52,011 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:39:52,012 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:39:52,020 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:39:52,021 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:39:52,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,065 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,065 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,065 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,101 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,102 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,130 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,132 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:39:52,172 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:39:52,197 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:39:52,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:39:52,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:39:52,199 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:39:52,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:39:52,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:39:52,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:39:52,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:39:52,226 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 15:39:52,228 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 15:39:52,374 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 15:39:52,375 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:39:52,391 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:39:52,416 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 15:39:52,476 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 15:39:52,477 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:39:52,487 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:39:52,510 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:39:52,511 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:39:58,155 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 15:39:58,292 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 15:39:58,313 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-27 15:39:58,313 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 15:39:58,317 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 15:40:16,499 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-27 15:40:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-27 15:40:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:40:16,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:16,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:40:16,508 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-27 15:40:16,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:16,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637294331] [2019-12-27 15:40:16,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:16,727 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 15:40:16,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637294331] [2019-12-27 15:40:16,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:16,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:40:16,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157693046] [2019-12-27 15:40:16,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:16,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:16,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:40:16,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:16,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:16,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:40:16,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:40:16,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:16,768 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-27 15:40:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:20,406 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-27 15:40:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:20,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:40:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:21,049 INFO L225 Difference]: With dead ends: 109312 [2019-12-27 15:40:21,049 INFO L226 Difference]: Without dead ends: 102592 [2019-12-27 15:40:21,051 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 15:40:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-27 15:40:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-27 15:40:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-27 15:40:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-27 15:40:28,265 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-27 15:40:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:28,266 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-27 15:40:28,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:40:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-27 15:40:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:40:28,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:28,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:28,269 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-27 15:40:28,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:28,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993860348] [2019-12-27 15:40:28,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:28,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993860348] [2019-12-27 15:40:28,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:28,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:28,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632263360] [2019-12-27 15:40:28,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:28,387 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:28,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:40:28,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:28,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:40:28,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:40:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:28,395 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-27 15:40:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:32,707 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-27 15:40:32,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:40:32,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:40:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:33,308 INFO L225 Difference]: With dead ends: 159508 [2019-12-27 15:40:33,308 INFO L226 Difference]: Without dead ends: 159459 [2019-12-27 15:40:33,309 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 15:40:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-27 15:40:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-27 15:40:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-27 15:40:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-27 15:40:46,752 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-27 15:40:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:46,753 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-27 15:40:46,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:40:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-27 15:40:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:40:46,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:46,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:46,762 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-27 15:40:46,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:46,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87215309] [2019-12-27 15:40:46,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:46,819 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 15:40:46,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87215309] [2019-12-27 15:40:46,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:46,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:46,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932508102] [2019-12-27 15:40:46,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:46,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:46,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:40:46,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:46,824 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:46,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:40:46,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:40:46,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:46,825 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-27 15:40:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:46,977 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-27 15:40:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:46,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:40:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:47,025 INFO L225 Difference]: With dead ends: 32284 [2019-12-27 15:40:47,025 INFO L226 Difference]: Without dead ends: 32284 [2019-12-27 15:40:47,026 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 15:40:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-27 15:40:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-27 15:40:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-27 15:40:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-27 15:40:47,617 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-27 15:40:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:47,617 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-27 15:40:47,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:40:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-27 15:40:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:40:47,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:47,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:47,622 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-27 15:40:47,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:47,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978309912] [2019-12-27 15:40:47,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:47,738 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 15:40:47,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978309912] [2019-12-27 15:40:47,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:47,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:47,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995357494] [2019-12-27 15:40:47,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:47,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:47,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:40:47,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:47,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:47,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:40:47,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:47,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:40:47,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:47,746 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-27 15:40:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:48,087 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-27 15:40:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:40:48,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:40:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:48,150 INFO L225 Difference]: With dead ends: 40215 [2019-12-27 15:40:48,150 INFO L226 Difference]: Without dead ends: 40215 [2019-12-27 15:40:48,150 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 15:40:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-27 15:40:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-27 15:40:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-27 15:40:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-27 15:40:51,142 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-27 15:40:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:51,143 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-27 15:40:51,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:40:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-27 15:40:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:40:51,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:51,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:51,152 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-27 15:40:51,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:51,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461641524] [2019-12-27 15:40:51,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:51,263 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 15:40:51,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461641524] [2019-12-27 15:40:51,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:51,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:40:51,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1757867962] [2019-12-27 15:40:51,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:51,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:51,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:40:51,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:51,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:51,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:40:51,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:40:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:40:51,281 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-27 15:40:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:51,865 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-27 15:40:51,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:40:51,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 15:40:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:51,934 INFO L225 Difference]: With dead ends: 46566 [2019-12-27 15:40:51,934 INFO L226 Difference]: Without dead ends: 46559 [2019-12-27 15:40:51,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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 15:40:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-27 15:40:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-27 15:40:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-27 15:40:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-27 15:40:52,627 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-27 15:40:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:52,628 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-27 15:40:52,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:40:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-27 15:40:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:40:52,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:52,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:52,641 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-27 15:40:52,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:52,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761985395] [2019-12-27 15:40:52,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:52,711 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 15:40:52,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761985395] [2019-12-27 15:40:52,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:52,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:40:52,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006968822] [2019-12-27 15:40:52,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:52,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:52,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:40:52,733 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:52,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:40:52,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:40:52,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:52,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:40:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:40:52,776 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 5 states. [2019-12-27 15:40:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:53,224 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-27 15:40:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:40:53,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:40:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:53,247 INFO L225 Difference]: With dead ends: 14498 [2019-12-27 15:40:53,247 INFO L226 Difference]: Without dead ends: 14498 [2019-12-27 15:40:53,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:40:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-27 15:40:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-27 15:40:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-27 15:40:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-27 15:40:53,470 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-27 15:40:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:53,470 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-27 15:40:53,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:40:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-27 15:40:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:40:53,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:53,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:53,481 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-27 15:40:53,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:53,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546575247] [2019-12-27 15:40:53,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:53,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546575247] [2019-12-27 15:40:53,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:53,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:40:53,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969170327] [2019-12-27 15:40:53,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:53,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:53,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:40:53,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:53,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:53,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:40:53,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:40:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:40:53,608 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-27 15:40:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:54,432 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-27 15:40:54,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:40:54,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:40:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:54,496 INFO L225 Difference]: With dead ends: 39008 [2019-12-27 15:40:54,496 INFO L226 Difference]: Without dead ends: 39008 [2019-12-27 15:40:54,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:40:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-27 15:40:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-27 15:40:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-27 15:40:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-27 15:40:54,978 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-27 15:40:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:54,979 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-27 15:40:54,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:40:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-27 15:40:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:40:54,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:54,995 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 15:40:54,996 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-27 15:40:54,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:54,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116058817] [2019-12-27 15:40:54,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:55,104 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 15:40:55,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116058817] [2019-12-27 15:40:55,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:55,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:40:55,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2081007969] [2019-12-27 15:40:55,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:55,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:55,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 15:40:55,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:55,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:55,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:40:55,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:55,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:40:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:40:55,124 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-27 15:40:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:55,845 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-27 15:40:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:40:55,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 15:40:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:55,909 INFO L225 Difference]: With dead ends: 43584 [2019-12-27 15:40:55,909 INFO L226 Difference]: Without dead ends: 43584 [2019-12-27 15:40:55,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:40:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-27 15:40:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-27 15:40:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-27 15:40:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-27 15:40:56,688 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-27 15:40:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:56,689 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-27 15:40:56,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:40:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-27 15:40:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:40:56,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:56,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:56,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-27 15:40:56,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:56,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058350967] [2019-12-27 15:40:56,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:56,808 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 15:40:56,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058350967] [2019-12-27 15:40:56,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:56,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:40:56,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222624471] [2019-12-27 15:40:56,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:56,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:56,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:40:56,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:56,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:56,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:40:56,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:56,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:40:56,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:40:56,831 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-27 15:40:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:58,168 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-27 15:40:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:40:58,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:40:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:58,269 INFO L225 Difference]: With dead ends: 51613 [2019-12-27 15:40:58,270 INFO L226 Difference]: Without dead ends: 51613 [2019-12-27 15:40:58,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:40:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-27 15:40:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-27 15:40:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-27 15:40:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-27 15:40:58,848 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-27 15:40:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:58,848 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-27 15:40:58,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:40:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-27 15:40:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:40:58,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:58,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] [2019-12-27 15:40:58,876 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-27 15:40:58,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:58,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790679146] [2019-12-27 15:40:58,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:58,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 15:40:58,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790679146] [2019-12-27 15:40:58,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:58,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:40:58,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654910912] [2019-12-27 15:40:58,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:59,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:59,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 15:40:59,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:59,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:40:59,060 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:40:59,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:40:59,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:59,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:40:59,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:40:59,062 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 9 states. [2019-12-27 15:41:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:02,636 INFO L93 Difference]: Finished difference Result 87829 states and 263704 transitions. [2019-12-27 15:41:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 15:41:02,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 15:41:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:02,792 INFO L225 Difference]: With dead ends: 87829 [2019-12-27 15:41:02,792 INFO L226 Difference]: Without dead ends: 87829 [2019-12-27 15:41:02,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:41:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87829 states. [2019-12-27 15:41:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87829 to 25448. [2019-12-27 15:41:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25448 states. [2019-12-27 15:41:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25448 states to 25448 states and 78846 transitions. [2019-12-27 15:41:03,652 INFO L78 Accepts]: Start accepts. Automaton has 25448 states and 78846 transitions. Word has length 33 [2019-12-27 15:41:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:03,652 INFO L462 AbstractCegarLoop]: Abstraction has 25448 states and 78846 transitions. [2019-12-27 15:41:03,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:41:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25448 states and 78846 transitions. [2019-12-27 15:41:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:41:03,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:03,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:03,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:03,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-27 15:41:03,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:03,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509830923] [2019-12-27 15:41:03,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:03,832 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 15:41:03,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509830923] [2019-12-27 15:41:03,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:03,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:41:03,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2042434069] [2019-12-27 15:41:03,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:03,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:03,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 15:41:03,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:03,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:03,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:41:03,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:41:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:03,865 INFO L87 Difference]: Start difference. First operand 25448 states and 78846 transitions. Second operand 7 states. [2019-12-27 15:41:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:05,309 INFO L93 Difference]: Finished difference Result 51173 states and 154813 transitions. [2019-12-27 15:41:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:41:05,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 15:41:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:05,385 INFO L225 Difference]: With dead ends: 51173 [2019-12-27 15:41:05,385 INFO L226 Difference]: Without dead ends: 51173 [2019-12-27 15:41:05,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:41:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51173 states. [2019-12-27 15:41:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51173 to 23042. [2019-12-27 15:41:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-27 15:41:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 71463 transitions. [2019-12-27 15:41:06,180 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 71463 transitions. Word has length 34 [2019-12-27 15:41:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:06,180 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 71463 transitions. [2019-12-27 15:41:06,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:41:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 71463 transitions. [2019-12-27 15:41:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:41:06,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:06,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:06,199 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-27 15:41:06,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:06,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823135614] [2019-12-27 15:41:06,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:06,356 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 15:41:06,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823135614] [2019-12-27 15:41:06,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:06,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:06,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394849995] [2019-12-27 15:41:06,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:06,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:06,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 15:41:06,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:06,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:41:06,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:41:06,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:41:06,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:41:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:41:06,407 INFO L87 Difference]: Start difference. First operand 23042 states and 71463 transitions. Second operand 9 states. [2019-12-27 15:41:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:09,191 INFO L93 Difference]: Finished difference Result 65771 states and 197406 transitions. [2019-12-27 15:41:09,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 15:41:09,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 15:41:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:09,306 INFO L225 Difference]: With dead ends: 65771 [2019-12-27 15:41:09,306 INFO L226 Difference]: Without dead ends: 65771 [2019-12-27 15:41:09,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:41:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65771 states. [2019-12-27 15:41:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65771 to 22835. [2019-12-27 15:41:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22835 states. [2019-12-27 15:41:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22835 states to 22835 states and 70869 transitions. [2019-12-27 15:41:09,965 INFO L78 Accepts]: Start accepts. Automaton has 22835 states and 70869 transitions. Word has length 34 [2019-12-27 15:41:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:09,965 INFO L462 AbstractCegarLoop]: Abstraction has 22835 states and 70869 transitions. [2019-12-27 15:41:09,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:41:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 22835 states and 70869 transitions. [2019-12-27 15:41:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:41:09,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:09,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:09,994 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:09,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2037707369, now seen corresponding path program 1 times [2019-12-27 15:41:09,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:09,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110239718] [2019-12-27 15:41:09,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:10,052 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 15:41:10,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110239718] [2019-12-27 15:41:10,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:10,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:41:10,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959698194] [2019-12-27 15:41:10,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:10,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:10,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 341 transitions. [2019-12-27 15:41:10,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:10,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:10,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:41:10,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:10,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:41:10,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:10,124 INFO L87 Difference]: Start difference. First operand 22835 states and 70869 transitions. Second operand 3 states. [2019-12-27 15:41:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:10,197 INFO L93 Difference]: Finished difference Result 22834 states and 70867 transitions. [2019-12-27 15:41:10,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:41:10,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:41:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:10,231 INFO L225 Difference]: With dead ends: 22834 [2019-12-27 15:41:10,231 INFO L226 Difference]: Without dead ends: 22834 [2019-12-27 15:41:10,231 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 15:41:10,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22834 states. [2019-12-27 15:41:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22834 to 22834. [2019-12-27 15:41:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22834 states. [2019-12-27 15:41:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22834 states to 22834 states and 70867 transitions. [2019-12-27 15:41:10,574 INFO L78 Accepts]: Start accepts. Automaton has 22834 states and 70867 transitions. Word has length 39 [2019-12-27 15:41:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:10,575 INFO L462 AbstractCegarLoop]: Abstraction has 22834 states and 70867 transitions. [2019-12-27 15:41:10,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:41:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 22834 states and 70867 transitions. [2019-12-27 15:41:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:41:10,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:10,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:10,607 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:10,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:10,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1505013692, now seen corresponding path program 1 times [2019-12-27 15:41:10,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:10,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392709316] [2019-12-27 15:41:10,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:10,660 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 15:41:10,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392709316] [2019-12-27 15:41:10,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:10,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:10,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939812931] [2019-12-27 15:41:10,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:10,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:10,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 415 transitions. [2019-12-27 15:41:10,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:10,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:41:10,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:41:10,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:10,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:41:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:41:10,887 INFO L87 Difference]: Start difference. First operand 22834 states and 70867 transitions. Second operand 4 states. [2019-12-27 15:41:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:11,173 INFO L93 Difference]: Finished difference Result 44040 states and 137112 transitions. [2019-12-27 15:41:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:41:11,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 15:41:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:11,210 INFO L225 Difference]: With dead ends: 44040 [2019-12-27 15:41:11,210 INFO L226 Difference]: Without dead ends: 24423 [2019-12-27 15:41:11,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:41:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24423 states. [2019-12-27 15:41:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24423 to 20630. [2019-12-27 15:41:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20630 states. [2019-12-27 15:41:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20630 states to 20630 states and 62945 transitions. [2019-12-27 15:41:11,556 INFO L78 Accepts]: Start accepts. Automaton has 20630 states and 62945 transitions. Word has length 40 [2019-12-27 15:41:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:11,557 INFO L462 AbstractCegarLoop]: Abstraction has 20630 states and 62945 transitions. [2019-12-27 15:41:11,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:41:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20630 states and 62945 transitions. [2019-12-27 15:41:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:41:11,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:11,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:11,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 2 times [2019-12-27 15:41:11,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:11,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753077041] [2019-12-27 15:41:11,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:11,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753077041] [2019-12-27 15:41:11,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:11,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:11,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931055011] [2019-12-27 15:41:11,670 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:11,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:11,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 413 transitions. [2019-12-27 15:41:11,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:12,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 15:41:12,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:41:12,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:41:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:41:12,238 INFO L87 Difference]: Start difference. First operand 20630 states and 62945 transitions. Second operand 15 states. [2019-12-27 15:41:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:15,434 INFO L93 Difference]: Finished difference Result 56663 states and 169644 transitions. [2019-12-27 15:41:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:41:15,435 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-12-27 15:41:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:15,527 INFO L225 Difference]: With dead ends: 56663 [2019-12-27 15:41:15,528 INFO L226 Difference]: Without dead ends: 56663 [2019-12-27 15:41:15,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:41:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56663 states. [2019-12-27 15:41:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56663 to 25754. [2019-12-27 15:41:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25754 states. [2019-12-27 15:41:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25754 states to 25754 states and 78278 transitions. [2019-12-27 15:41:16,470 INFO L78 Accepts]: Start accepts. Automaton has 25754 states and 78278 transitions. Word has length 40 [2019-12-27 15:41:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:16,470 INFO L462 AbstractCegarLoop]: Abstraction has 25754 states and 78278 transitions. [2019-12-27 15:41:16,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:41:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 25754 states and 78278 transitions. [2019-12-27 15:41:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:41:16,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:16,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:16,495 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 3 times [2019-12-27 15:41:16,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:16,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863829652] [2019-12-27 15:41:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:16,555 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 15:41:16,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863829652] [2019-12-27 15:41:16,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:16,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:41:16,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294456110] [2019-12-27 15:41:16,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:16,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:16,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 368 transitions. [2019-12-27 15:41:16,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:16,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:41:16,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:41:16,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:41:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:16,683 INFO L87 Difference]: Start difference. First operand 25754 states and 78278 transitions. Second operand 7 states. [2019-12-27 15:41:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:16,783 INFO L93 Difference]: Finished difference Result 24359 states and 74979 transitions. [2019-12-27 15:41:16,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:41:16,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 15:41:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:16,816 INFO L225 Difference]: With dead ends: 24359 [2019-12-27 15:41:16,816 INFO L226 Difference]: Without dead ends: 22574 [2019-12-27 15:41:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-27 15:41:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 21370. [2019-12-27 15:41:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21370 states. [2019-12-27 15:41:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21370 states to 21370 states and 67242 transitions. [2019-12-27 15:41:17,148 INFO L78 Accepts]: Start accepts. Automaton has 21370 states and 67242 transitions. Word has length 40 [2019-12-27 15:41:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:17,148 INFO L462 AbstractCegarLoop]: Abstraction has 21370 states and 67242 transitions. [2019-12-27 15:41:17,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:41:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 21370 states and 67242 transitions. [2019-12-27 15:41:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:17,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:17,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:17,170 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:17,170 INFO L82 PathProgramCache]: Analyzing trace with hash -157681056, now seen corresponding path program 1 times [2019-12-27 15:41:17,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:17,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43938165] [2019-12-27 15:41:17,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:17,307 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 15:41:17,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43938165] [2019-12-27 15:41:17,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:17,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:41:17,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413591437] [2019-12-27 15:41:17,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:17,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:17,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 224 transitions. [2019-12-27 15:41:17,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:17,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:41:17,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:41:17,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:41:17,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:41:17,541 INFO L87 Difference]: Start difference. First operand 21370 states and 67242 transitions. Second operand 10 states. [2019-12-27 15:41:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:19,670 INFO L93 Difference]: Finished difference Result 183019 states and 567679 transitions. [2019-12-27 15:41:19,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 15:41:19,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 15:41:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:19,907 INFO L225 Difference]: With dead ends: 183019 [2019-12-27 15:41:19,907 INFO L226 Difference]: Without dead ends: 137522 [2019-12-27 15:41:19,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:41:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137522 states. [2019-12-27 15:41:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137522 to 29901. [2019-12-27 15:41:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29901 states. [2019-12-27 15:41:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29901 states to 29901 states and 94063 transitions. [2019-12-27 15:41:21,594 INFO L78 Accepts]: Start accepts. Automaton has 29901 states and 94063 transitions. Word has length 64 [2019-12-27 15:41:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:21,594 INFO L462 AbstractCegarLoop]: Abstraction has 29901 states and 94063 transitions. [2019-12-27 15:41:21,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:41:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 29901 states and 94063 transitions. [2019-12-27 15:41:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:21,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:21,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:41:21,631 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1424569061, now seen corresponding path program 1 times [2019-12-27 15:41:21,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:21,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498002478] [2019-12-27 15:41:21,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:21,692 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 15:41:21,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498002478] [2019-12-27 15:41:21,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:21,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:41:21,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387814451] [2019-12-27 15:41:21,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:21,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:22,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 421 transitions. [2019-12-27 15:41:22,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:22,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:41:22,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:41:22,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:41:22,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:22,011 INFO L87 Difference]: Start difference. First operand 29901 states and 94063 transitions. Second operand 3 states. [2019-12-27 15:41:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:22,234 INFO L93 Difference]: Finished difference Result 36806 states and 112569 transitions. [2019-12-27 15:41:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:41:22,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:41:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:22,315 INFO L225 Difference]: With dead ends: 36806 [2019-12-27 15:41:22,315 INFO L226 Difference]: Without dead ends: 36080 [2019-12-27 15:41:22,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36080 states. [2019-12-27 15:41:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36080 to 28408. [2019-12-27 15:41:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28408 states. [2019-12-27 15:41:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28408 states to 28408 states and 88020 transitions. [2019-12-27 15:41:22,924 INFO L78 Accepts]: Start accepts. Automaton has 28408 states and 88020 transitions. Word has length 64 [2019-12-27 15:41:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:22,924 INFO L462 AbstractCegarLoop]: Abstraction has 28408 states and 88020 transitions. [2019-12-27 15:41:22,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:41:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28408 states and 88020 transitions. [2019-12-27 15:41:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:22,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:22,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:22,960 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -776372898, now seen corresponding path program 2 times [2019-12-27 15:41:22,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:22,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755285734] [2019-12-27 15:41:22,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:23,076 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 15:41:23,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755285734] [2019-12-27 15:41:23,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:23,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:41:23,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [570950248] [2019-12-27 15:41:23,077 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:23,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:23,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 264 states and 516 transitions. [2019-12-27 15:41:23,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:23,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 15:41:23,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:41:23,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:41:23,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:41:23,691 INFO L87 Difference]: Start difference. First operand 28408 states and 88020 transitions. Second operand 11 states. [2019-12-27 15:41:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:26,568 INFO L93 Difference]: Finished difference Result 179989 states and 543697 transitions. [2019-12-27 15:41:26,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 15:41:26,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 15:41:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:26,775 INFO L225 Difference]: With dead ends: 179989 [2019-12-27 15:41:26,775 INFO L226 Difference]: Without dead ends: 134256 [2019-12-27 15:41:26,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=560, Invalid=1990, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 15:41:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134256 states. [2019-12-27 15:41:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134256 to 31129. [2019-12-27 15:41:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31129 states. [2019-12-27 15:41:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31129 states to 31129 states and 96515 transitions. [2019-12-27 15:41:28,690 INFO L78 Accepts]: Start accepts. Automaton has 31129 states and 96515 transitions. Word has length 64 [2019-12-27 15:41:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:28,690 INFO L462 AbstractCegarLoop]: Abstraction has 31129 states and 96515 transitions. [2019-12-27 15:41:28,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:41:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 31129 states and 96515 transitions. [2019-12-27 15:41:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:28,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:28,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:28,725 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1881233072, now seen corresponding path program 3 times [2019-12-27 15:41:28,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:28,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144215985] [2019-12-27 15:41:28,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:28,818 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 15:41:28,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144215985] [2019-12-27 15:41:28,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:28,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:28,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557223567] [2019-12-27 15:41:28,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:28,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:29,059 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 324 transitions. [2019-12-27 15:41:29,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:29,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:41:29,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:41:29,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:41:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:41:29,089 INFO L87 Difference]: Start difference. First operand 31129 states and 96515 transitions. Second operand 8 states. [2019-12-27 15:41:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:29,934 INFO L93 Difference]: Finished difference Result 88169 states and 267542 transitions. [2019-12-27 15:41:29,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:41:29,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 15:41:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:30,102 INFO L225 Difference]: With dead ends: 88169 [2019-12-27 15:41:30,102 INFO L226 Difference]: Without dead ends: 61143 [2019-12-27 15:41:30,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:41:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61143 states. [2019-12-27 15:41:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61143 to 34558. [2019-12-27 15:41:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34558 states. [2019-12-27 15:41:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34558 states to 34558 states and 106901 transitions. [2019-12-27 15:41:31,089 INFO L78 Accepts]: Start accepts. Automaton has 34558 states and 106901 transitions. Word has length 64 [2019-12-27 15:41:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:31,090 INFO L462 AbstractCegarLoop]: Abstraction has 34558 states and 106901 transitions. [2019-12-27 15:41:31,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:41:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 34558 states and 106901 transitions. [2019-12-27 15:41:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:31,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:31,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:31,132 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1457184858, now seen corresponding path program 4 times [2019-12-27 15:41:31,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:31,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294330960] [2019-12-27 15:41:31,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:31,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294330960] [2019-12-27 15:41:31,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:31,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:31,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [420714923] [2019-12-27 15:41:31,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:31,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:31,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 333 transitions. [2019-12-27 15:41:31,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:31,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 15:41:31,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:41:31,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:41:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:41:31,559 INFO L87 Difference]: Start difference. First operand 34558 states and 106901 transitions. Second operand 12 states. [2019-12-27 15:41:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:33,477 INFO L93 Difference]: Finished difference Result 86437 states and 262270 transitions. [2019-12-27 15:41:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:41:33,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 15:41:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:33,590 INFO L225 Difference]: With dead ends: 86437 [2019-12-27 15:41:33,590 INFO L226 Difference]: Without dead ends: 74888 [2019-12-27 15:41:33,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:41:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74888 states. [2019-12-27 15:41:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74888 to 34454. [2019-12-27 15:41:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34454 states. [2019-12-27 15:41:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34454 states to 34454 states and 106578 transitions. [2019-12-27 15:41:34,458 INFO L78 Accepts]: Start accepts. Automaton has 34454 states and 106578 transitions. Word has length 64 [2019-12-27 15:41:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:34,458 INFO L462 AbstractCegarLoop]: Abstraction has 34454 states and 106578 transitions. [2019-12-27 15:41:34,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:41:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 34454 states and 106578 transitions. [2019-12-27 15:41:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:34,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:34,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:34,503 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash 125444336, now seen corresponding path program 5 times [2019-12-27 15:41:34,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:34,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743937250] [2019-12-27 15:41:34,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:34,569 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 15:41:34,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743937250] [2019-12-27 15:41:34,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:34,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:34,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636425497] [2019-12-27 15:41:34,571 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:34,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:34,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 316 transitions. [2019-12-27 15:41:34,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:34,750 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:41:34,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:41:34,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:41:34,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:34,751 INFO L87 Difference]: Start difference. First operand 34454 states and 106578 transitions. Second operand 3 states. [2019-12-27 15:41:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:34,904 INFO L93 Difference]: Finished difference Result 39915 states and 122743 transitions. [2019-12-27 15:41:34,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:41:34,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:41:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:34,963 INFO L225 Difference]: With dead ends: 39915 [2019-12-27 15:41:34,964 INFO L226 Difference]: Without dead ends: 39915 [2019-12-27 15:41:34,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 15:41:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39915 states. [2019-12-27 15:41:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39915 to 35402. [2019-12-27 15:41:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35402 states. [2019-12-27 15:41:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35402 states to 35402 states and 109573 transitions. [2019-12-27 15:41:35,580 INFO L78 Accepts]: Start accepts. Automaton has 35402 states and 109573 transitions. Word has length 64 [2019-12-27 15:41:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:35,581 INFO L462 AbstractCegarLoop]: Abstraction has 35402 states and 109573 transitions. [2019-12-27 15:41:35,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:41:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 35402 states and 109573 transitions. [2019-12-27 15:41:35,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:41:35,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:35,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:35,623 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:35,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash -850815266, now seen corresponding path program 1 times [2019-12-27 15:41:35,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:35,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292922297] [2019-12-27 15:41:35,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:35,760 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 15:41:35,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292922297] [2019-12-27 15:41:35,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:35,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:41:35,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25053900] [2019-12-27 15:41:35,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:35,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:35,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 227 transitions. [2019-12-27 15:41:35,919 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:35,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:41:35,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:41:35,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:41:35,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:41:35,974 INFO L87 Difference]: Start difference. First operand 35402 states and 109573 transitions. Second operand 10 states. [2019-12-27 15:41:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:37,797 INFO L93 Difference]: Finished difference Result 133553 states and 403377 transitions. [2019-12-27 15:41:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:41:37,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 15:41:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:37,993 INFO L225 Difference]: With dead ends: 133553 [2019-12-27 15:41:37,993 INFO L226 Difference]: Without dead ends: 122254 [2019-12-27 15:41:37,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:41:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122254 states. [2019-12-27 15:41:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122254 to 37122. [2019-12-27 15:41:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37122 states. [2019-12-27 15:41:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37122 states to 37122 states and 114400 transitions. [2019-12-27 15:41:39,239 INFO L78 Accepts]: Start accepts. Automaton has 37122 states and 114400 transitions. Word has length 65 [2019-12-27 15:41:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:39,239 INFO L462 AbstractCegarLoop]: Abstraction has 37122 states and 114400 transitions. [2019-12-27 15:41:39,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:41:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37122 states and 114400 transitions. [2019-12-27 15:41:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:41:39,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:39,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:39,278 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2088772025, now seen corresponding path program 1 times [2019-12-27 15:41:39,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:39,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203408367] [2019-12-27 15:41:39,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:39,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203408367] [2019-12-27 15:41:39,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:39,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:41:39,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251720454] [2019-12-27 15:41:39,381 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:39,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:39,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 465 transitions. [2019-12-27 15:41:39,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:39,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:41:40,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 15:41:40,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:41:40,184 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-12-27 15:41:40,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:41:40,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 15:41:40,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 15:41:40,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 15:41:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:41:40,344 INFO L87 Difference]: Start difference. First operand 37122 states and 114400 transitions. Second operand 18 states. [2019-12-27 15:41:45,034 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:41:45,220 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-27 15:41:45,523 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:41:45,741 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:41:46,014 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:41:46,281 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:41:46,494 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:41:46,660 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-27 15:41:46,920 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 15:41:47,087 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:41:47,304 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:41:47,469 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:41:47,766 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:41:47,925 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:41:48,170 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-27 15:41:48,501 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-27 15:41:48,671 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:41:48,949 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-27 15:41:49,173 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-27 15:41:49,370 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-27 15:41:49,561 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-12-27 15:41:50,381 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-12-27 15:41:50,582 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-12-27 15:41:50,749 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:41:50,887 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 15:41:51,283 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-12-27 15:41:51,485 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-12-27 15:41:51,728 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 15:41:51,870 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 15:41:52,030 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 15:41:52,165 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 15:41:52,527 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-27 15:41:52,847 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:41:52,987 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 15:41:53,156 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 15:41:53,513 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:41:53,668 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 15:41:53,906 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 15:41:54,061 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-27 15:41:54,315 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-27 15:41:54,960 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 15:41:55,133 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:41:55,310 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-27 15:41:55,509 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 15:41:55,862 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 15:41:56,030 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 15:41:56,539 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:41:56,737 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-27 15:41:56,890 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-27 15:41:57,174 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-27 15:41:57,716 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:41:57,895 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:41:58,316 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 15:41:58,510 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-27 15:41:58,662 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 15:41:58,836 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 15:41:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:59,326 INFO L93 Difference]: Finished difference Result 164745 states and 494733 transitions. [2019-12-27 15:41:59,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-12-27 15:41:59,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-27 15:41:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:59,535 INFO L225 Difference]: With dead ends: 164745 [2019-12-27 15:41:59,536 INFO L226 Difference]: Without dead ends: 137750 [2019-12-27 15:41:59,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8328 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=3368, Invalid=16938, Unknown=0, NotChecked=0, Total=20306 [2019-12-27 15:41:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137750 states. [2019-12-27 15:42:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137750 to 37203. [2019-12-27 15:42:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37203 states. [2019-12-27 15:42:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37203 states to 37203 states and 115403 transitions. [2019-12-27 15:42:01,043 INFO L78 Accepts]: Start accepts. Automaton has 37203 states and 115403 transitions. Word has length 65 [2019-12-27 15:42:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:01,043 INFO L462 AbstractCegarLoop]: Abstraction has 37203 states and 115403 transitions. [2019-12-27 15:42:01,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 15:42:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 37203 states and 115403 transitions. [2019-12-27 15:42:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:01,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:01,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:01,087 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 1 times [2019-12-27 15:42:01,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:01,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025399814] [2019-12-27 15:42:01,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:01,213 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 15:42:01,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025399814] [2019-12-27 15:42:01,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:01,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:42:01,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1867363908] [2019-12-27 15:42:01,216 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:01,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:01,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 365 transitions. [2019-12-27 15:42:01,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:01,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:42:01,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:42:01,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:42:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:42:01,695 INFO L87 Difference]: Start difference. First operand 37203 states and 115403 transitions. Second operand 9 states. [2019-12-27 15:42:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:05,115 INFO L93 Difference]: Finished difference Result 90731 states and 274184 transitions. [2019-12-27 15:42:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 15:42:05,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:42:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:05,250 INFO L225 Difference]: With dead ends: 90731 [2019-12-27 15:42:05,250 INFO L226 Difference]: Without dead ends: 90731 [2019-12-27 15:42:05,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 15:42:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90731 states. [2019-12-27 15:42:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90731 to 39919. [2019-12-27 15:42:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39919 states. [2019-12-27 15:42:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39919 states to 39919 states and 124432 transitions. [2019-12-27 15:42:06,423 INFO L78 Accepts]: Start accepts. Automaton has 39919 states and 124432 transitions. Word has length 65 [2019-12-27 15:42:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:06,423 INFO L462 AbstractCegarLoop]: Abstraction has 39919 states and 124432 transitions. [2019-12-27 15:42:06,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:42:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 39919 states and 124432 transitions. [2019-12-27 15:42:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:06,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:06,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:06,468 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 2 times [2019-12-27 15:42:06,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:06,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991447909] [2019-12-27 15:42:06,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:06,622 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 15:42:06,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991447909] [2019-12-27 15:42:06,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:06,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:42:06,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417100736] [2019-12-27 15:42:06,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:06,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:06,855 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 311 transitions. [2019-12-27 15:42:06,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:06,983 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:42:06,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:42:06,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:42:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:42:06,984 INFO L87 Difference]: Start difference. First operand 39919 states and 124432 transitions. Second operand 11 states. [2019-12-27 15:42:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:13,301 INFO L93 Difference]: Finished difference Result 87020 states and 259878 transitions. [2019-12-27 15:42:13,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 15:42:13,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:42:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:13,438 INFO L225 Difference]: With dead ends: 87020 [2019-12-27 15:42:13,438 INFO L226 Difference]: Without dead ends: 86768 [2019-12-27 15:42:13,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=863, Invalid=5143, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 15:42:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86768 states. [2019-12-27 15:42:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86768 to 44259. [2019-12-27 15:42:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44259 states. [2019-12-27 15:42:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44259 states to 44259 states and 137970 transitions. [2019-12-27 15:42:14,610 INFO L78 Accepts]: Start accepts. Automaton has 44259 states and 137970 transitions. Word has length 65 [2019-12-27 15:42:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:14,610 INFO L462 AbstractCegarLoop]: Abstraction has 44259 states and 137970 transitions. [2019-12-27 15:42:14,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:42:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 44259 states and 137970 transitions. [2019-12-27 15:42:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:14,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:14,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:14,660 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:14,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1064039577, now seen corresponding path program 2 times [2019-12-27 15:42:14,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:14,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163845220] [2019-12-27 15:42:14,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:14,719 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 15:42:14,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163845220] [2019-12-27 15:42:14,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:14,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:42:14,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10591115] [2019-12-27 15:42:14,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:14,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:15,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 319 transitions. [2019-12-27 15:42:15,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:15,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:42:15,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:42:15,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:42:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:42:15,224 INFO L87 Difference]: Start difference. First operand 44259 states and 137970 transitions. Second operand 4 states. [2019-12-27 15:42:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:15,443 INFO L93 Difference]: Finished difference Result 51639 states and 160267 transitions. [2019-12-27 15:42:15,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:42:15,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 15:42:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:15,523 INFO L225 Difference]: With dead ends: 51639 [2019-12-27 15:42:15,523 INFO L226 Difference]: Without dead ends: 51639 [2019-12-27 15:42:15,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:42:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51639 states. [2019-12-27 15:42:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51639 to 45008. [2019-12-27 15:42:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45008 states. [2019-12-27 15:42:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45008 states to 45008 states and 140511 transitions. [2019-12-27 15:42:16,285 INFO L78 Accepts]: Start accepts. Automaton has 45008 states and 140511 transitions. Word has length 65 [2019-12-27 15:42:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:16,285 INFO L462 AbstractCegarLoop]: Abstraction has 45008 states and 140511 transitions. [2019-12-27 15:42:16,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:42:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 45008 states and 140511 transitions. [2019-12-27 15:42:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:16,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:16,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:16,334 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1405468218, now seen corresponding path program 3 times [2019-12-27 15:42:16,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:16,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548172945] [2019-12-27 15:42:16,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:16,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 15:42:16,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548172945] [2019-12-27 15:42:16,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:16,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:42:16,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377916640] [2019-12-27 15:42:16,499 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:16,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:16,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 247 transitions. [2019-12-27 15:42:16,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:16,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:42:16,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 15:42:16,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 15:42:16,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:42:16,894 INFO L87 Difference]: Start difference. First operand 45008 states and 140511 transitions. Second operand 14 states. [2019-12-27 15:42:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:24,601 INFO L93 Difference]: Finished difference Result 146092 states and 441615 transitions. [2019-12-27 15:42:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 15:42:24,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 15:42:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:24,822 INFO L225 Difference]: With dead ends: 146092 [2019-12-27 15:42:24,822 INFO L226 Difference]: Without dead ends: 146022 [2019-12-27 15:42:24,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=501, Invalid=2469, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 15:42:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146022 states. [2019-12-27 15:42:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146022 to 50907. [2019-12-27 15:42:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50907 states. [2019-12-27 15:42:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50907 states to 50907 states and 159543 transitions. [2019-12-27 15:42:26,571 INFO L78 Accepts]: Start accepts. Automaton has 50907 states and 159543 transitions. Word has length 65 [2019-12-27 15:42:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:26,571 INFO L462 AbstractCegarLoop]: Abstraction has 50907 states and 159543 transitions. [2019-12-27 15:42:26,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 15:42:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 50907 states and 159543 transitions. [2019-12-27 15:42:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:26,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:26,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:26,631 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1428822976, now seen corresponding path program 4 times [2019-12-27 15:42:26,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:26,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861572685] [2019-12-27 15:42:26,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:26,689 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 15:42:26,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861572685] [2019-12-27 15:42:26,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:26,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:26,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2757186] [2019-12-27 15:42:26,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:26,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:26,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 222 transitions. [2019-12-27 15:42:26,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:26,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:42:26,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:26,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:26,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:26,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:26,881 INFO L87 Difference]: Start difference. First operand 50907 states and 159543 transitions. Second operand 3 states. [2019-12-27 15:42:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:27,102 INFO L93 Difference]: Finished difference Result 38079 states and 119072 transitions. [2019-12-27 15:42:27,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:27,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:42:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:27,189 INFO L225 Difference]: With dead ends: 38079 [2019-12-27 15:42:27,190 INFO L226 Difference]: Without dead ends: 38079 [2019-12-27 15:42:27,190 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 15:42:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38079 states. [2019-12-27 15:42:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38079 to 35550. [2019-12-27 15:42:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2019-12-27 15:42:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 110872 transitions. [2019-12-27 15:42:28,191 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 110872 transitions. Word has length 65 [2019-12-27 15:42:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:28,191 INFO L462 AbstractCegarLoop]: Abstraction has 35550 states and 110872 transitions. [2019-12-27 15:42:28,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 110872 transitions. [2019-12-27 15:42:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:42:28,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:28,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:28,233 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1442275055, now seen corresponding path program 1 times [2019-12-27 15:42:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:28,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624569064] [2019-12-27 15:42:28,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:42:28,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624569064] [2019-12-27 15:42:28,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:28,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:28,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388670293] [2019-12-27 15:42:28,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:28,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:28,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 385 transitions. [2019-12-27 15:42:28,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:28,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:42:28,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:28,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:28,587 INFO L87 Difference]: Start difference. First operand 35550 states and 110872 transitions. Second operand 3 states. [2019-12-27 15:42:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:28,805 INFO L93 Difference]: Finished difference Result 35550 states and 110871 transitions. [2019-12-27 15:42:28,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:28,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 15:42:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:28,889 INFO L225 Difference]: With dead ends: 35550 [2019-12-27 15:42:28,889 INFO L226 Difference]: Without dead ends: 35550 [2019-12-27 15:42:28,891 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 15:42:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35550 states. [2019-12-27 15:42:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35550 to 21625. [2019-12-27 15:42:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21625 states. [2019-12-27 15:42:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21625 states to 21625 states and 68197 transitions. [2019-12-27 15:42:29,399 INFO L78 Accepts]: Start accepts. Automaton has 21625 states and 68197 transitions. Word has length 66 [2019-12-27 15:42:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:29,400 INFO L462 AbstractCegarLoop]: Abstraction has 21625 states and 68197 transitions. [2019-12-27 15:42:29,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21625 states and 68197 transitions. [2019-12-27 15:42:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:42:29,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:29,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:29,422 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:29,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-27 15:42:29,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:29,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176655829] [2019-12-27 15:42:29,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:42:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:42:29,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:42:29,540 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:42:29,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t153~0.base_27| 4) |v_#length_23|) (= v_~weak$$choice2~0_147 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= |v_ULTIMATE.start_main_~#t153~0.offset_17| 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27| 1) |v_#valid_73|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27|) 0) (= 0 v_~x~0_154) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t153~0.base_27|) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27|) |v_ULTIMATE.start_main_~#t153~0.offset_17| 0)) |v_#memory_int_19|) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t153~0.base=|v_ULTIMATE.start_main_~#t153~0.base_27|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_22|, ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ULTIMATE.start_main_~#t153~0.offset=|v_ULTIMATE.start_main_~#t153~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t153~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t155~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t154~0.base, ULTIMATE.start_main_~#t155~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t153~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:42:29,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t154~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t154~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11|) |v_ULTIMATE.start_main_~#t154~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t154~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t154~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t154~0.base] because there is no mapped edge [2019-12-27 15:42:29,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 15:42:29,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In834449670 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In834449670 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out834449670| ~z~0_In834449670)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out834449670| ~z$w_buff1~0_In834449670) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In834449670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In834449670, ~z$w_buff1~0=~z$w_buff1~0_In834449670, ~z~0=~z~0_In834449670} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out834449670|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In834449670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In834449670, ~z$w_buff1~0=~z$w_buff1~0_In834449670, ~z~0=~z~0_In834449670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 15:42:29,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 15:42:29,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1341294952 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1341294952 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1341294952| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1341294952| ~z$w_buff0_used~0_In1341294952)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1341294952, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1341294952} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1341294952, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1341294952|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1341294952} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:42:29,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-132397107 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-132397107 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-132397107 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-132397107 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-132397107| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-132397107 |P1Thread1of1ForFork2_#t~ite12_Out-132397107|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-132397107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-132397107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132397107, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-132397107} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-132397107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-132397107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132397107, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-132397107|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-132397107} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:42:29,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9|) |v_ULTIMATE.start_main_~#t155~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t155~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t155~0.base_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t155~0.base_9| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t155~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t155~0.base, ULTIMATE.start_main_~#t155~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 15:42:29,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In422336586 256)))) (or (and (= ~z$w_buff0~0_In422336586 |P2Thread1of1ForFork0_#t~ite20_Out422336586|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In422336586 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In422336586 256)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In422336586 256))) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In422336586 256))))) (= |P2Thread1of1ForFork0_#t~ite21_Out422336586| |P2Thread1of1ForFork0_#t~ite20_Out422336586|) .cse1) (and (= ~z$w_buff0~0_In422336586 |P2Thread1of1ForFork0_#t~ite21_Out422336586|) (= |P2Thread1of1ForFork0_#t~ite20_In422336586| |P2Thread1of1ForFork0_#t~ite20_Out422336586|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In422336586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In422336586, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In422336586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In422336586, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In422336586, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In422336586|, ~weak$$choice2~0=~weak$$choice2~0_In422336586} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out422336586|, ~z$w_buff0~0=~z$w_buff0~0_In422336586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In422336586, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In422336586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In422336586, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In422336586, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out422336586|, ~weak$$choice2~0=~weak$$choice2~0_In422336586} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 15:42:29,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2077026156 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In2077026156 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out2077026156|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In2077026156 |P1Thread1of1ForFork2_#t~ite13_Out2077026156|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2077026156, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2077026156} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2077026156, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2077026156|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2077026156} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:42:29,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1180033965 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1180033965 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1180033965 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1180033965 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1180033965| ~z$r_buff1_thd2~0_In1180033965)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite14_Out1180033965| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1180033965, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1180033965, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1180033965, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1180033965} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1180033965, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1180033965, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1180033965, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1180033965|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1180033965} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:42:29,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:42:29,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2145233592 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2145233592 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-2145233592 256) 0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-2145233592 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-2145233592 256))))) (= ~z$w_buff1~0_In-2145233592 |P2Thread1of1ForFork0_#t~ite23_Out-2145233592|) .cse1 (= |P2Thread1of1ForFork0_#t~ite24_Out-2145233592| |P2Thread1of1ForFork0_#t~ite23_Out-2145233592|)) (and (= ~z$w_buff1~0_In-2145233592 |P2Thread1of1ForFork0_#t~ite24_Out-2145233592|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In-2145233592| |P2Thread1of1ForFork0_#t~ite23_Out-2145233592|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145233592, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2145233592, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-2145233592|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2145233592, ~z$w_buff1~0=~z$w_buff1~0_In-2145233592, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2145233592, ~weak$$choice2~0=~weak$$choice2~0_In-2145233592} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2145233592, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-2145233592|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2145233592, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-2145233592|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2145233592, ~z$w_buff1~0=~z$w_buff1~0_In-2145233592, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2145233592, ~weak$$choice2~0=~weak$$choice2~0_In-2145233592} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 15:42:29,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1634035157 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1634035157| |P2Thread1of1ForFork0_#t~ite26_Out-1634035157|) (= ~z$w_buff0_used~0_In-1634035157 |P2Thread1of1ForFork0_#t~ite26_Out-1634035157|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1634035157 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1634035157 256))) (= (mod ~z$w_buff0_used~0_In-1634035157 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1634035157 256))))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1634035157| ~z$w_buff0_used~0_In-1634035157) (= |P2Thread1of1ForFork0_#t~ite26_In-1634035157| |P2Thread1of1ForFork0_#t~ite26_Out-1634035157|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1634035157|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634035157, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1634035157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1634035157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1634035157, ~weak$$choice2~0=~weak$$choice2~0_In-1634035157} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1634035157|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1634035157|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634035157, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1634035157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1634035157, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1634035157, ~weak$$choice2~0=~weak$$choice2~0_In-1634035157} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 15:42:29,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 15:42:29,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 15:42:29,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1130225245 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1130225245 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1130225245|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1130225245 |P0Thread1of1ForFork1_#t~ite5_Out1130225245|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1130225245, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1130225245} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1130225245|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1130225245, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1130225245} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:42:29,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1944955308 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1944955308 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1944955308| ~z~0_In1944955308)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1944955308| ~z$w_buff1~0_In1944955308)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1944955308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1944955308, ~z$w_buff1~0=~z$w_buff1~0_In1944955308, ~z~0=~z~0_In1944955308} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1944955308|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1944955308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1944955308, ~z$w_buff1~0=~z$w_buff1~0_In1944955308, ~z~0=~z~0_In1944955308} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:42:29,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-545509178 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-545509178 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-545509178 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-545509178 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-545509178|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-545509178 |P0Thread1of1ForFork1_#t~ite6_Out-545509178|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-545509178, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-545509178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545509178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-545509178} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-545509178, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-545509178|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-545509178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545509178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-545509178} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:42:29,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In711003256 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In711003256 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out711003256) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In711003256 ~z$r_buff0_thd1~0_Out711003256) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In711003256, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In711003256} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In711003256, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out711003256|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out711003256} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:42:29,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1505521307 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1505521307 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1505521307 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1505521307 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1505521307|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1505521307 |P0Thread1of1ForFork1_#t~ite8_Out1505521307|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1505521307, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1505521307, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505521307, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1505521307} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1505521307|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1505521307, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1505521307, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505521307, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1505521307} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:42:29,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:42:29,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 15:42:29,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1852812777 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852812777 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1852812777 |P2Thread1of1ForFork0_#t~ite40_Out-1852812777|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1852812777| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852812777, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1852812777} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852812777, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1852812777|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1852812777} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:42:29,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In319565252 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In319565252 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In319565252 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In319565252 256)))) (or (and (= ~z$w_buff1_used~0_In319565252 |P2Thread1of1ForFork0_#t~ite41_Out319565252|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out319565252|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In319565252, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In319565252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319565252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In319565252} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In319565252, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In319565252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319565252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In319565252, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out319565252|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:42:29,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-523295045 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-523295045 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-523295045| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-523295045| ~z$r_buff0_thd3~0_In-523295045) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-523295045, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-523295045} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-523295045, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-523295045, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-523295045|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:42:29,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In599127156 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In599127156 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In599127156 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In599127156 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out599127156| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out599127156| ~z$r_buff1_thd3~0_In599127156) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In599127156, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In599127156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599127156, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In599127156} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out599127156|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599127156, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In599127156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599127156, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In599127156} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:42:29,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:42:29,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:42:29,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-174370015 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-174370015 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-174370015| |ULTIMATE.start_main_#t~ite48_Out-174370015|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-174370015| ~z$w_buff1~0_In-174370015) .cse2) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-174370015| ~z~0_In-174370015) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174370015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174370015, ~z$w_buff1~0=~z$w_buff1~0_In-174370015, ~z~0=~z~0_In-174370015} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174370015, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-174370015|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174370015, ~z$w_buff1~0=~z$w_buff1~0_In-174370015, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-174370015|, ~z~0=~z~0_In-174370015} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:42:29,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1432752775 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1432752775 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1432752775| ~z$w_buff0_used~0_In1432752775)) (and (= |ULTIMATE.start_main_#t~ite49_Out1432752775| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1432752775, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1432752775} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1432752775, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1432752775, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1432752775|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:42:29,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1711995762 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1711995762 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1711995762 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1711995762 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1711995762 |ULTIMATE.start_main_#t~ite50_Out-1711995762|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out-1711995762| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1711995762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711995762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1711995762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1711995762} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1711995762|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1711995762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711995762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1711995762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1711995762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:42:29,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1282287731 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1282287731 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1282287731| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1282287731 |ULTIMATE.start_main_#t~ite51_Out1282287731|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1282287731, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1282287731, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1282287731|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:42:29,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In194695637 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In194695637 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In194695637 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In194695637 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In194695637 |ULTIMATE.start_main_#t~ite52_Out194695637|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out194695637|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In194695637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In194695637, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In194695637, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194695637} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out194695637|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In194695637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In194695637, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In194695637, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194695637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:42:29,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:42:29,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:42:29 BasicIcfg [2019-12-27 15:42:29,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:42:29,678 INFO L168 Benchmark]: Toolchain (without parser) took 159580.21 ms. Allocated memory was 138.4 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 99.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 15:42:29,679 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:42:29,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.05 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 156.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:29,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:29,680 INFO L168 Benchmark]: Boogie Preprocessor took 48.60 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:29,680 INFO L168 Benchmark]: RCFGBuilder took 1029.09 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 100.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:29,680 INFO L168 Benchmark]: TraceAbstraction took 157683.64 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 15:42:29,684 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.05 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 156.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.60 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1029.09 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 100.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157683.64 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 157.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 75.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8431 SDtfs, 15880 SDslu, 32171 SDs, 0 SdLazy, 27768 SolverSat, 1223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 213 SyntacticMatches, 77 SemanticMatches, 641 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14166 ImplicationChecksByTransitivity, 23.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 952699 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1410 NumberOfCodeBlocks, 1410 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1313 ConstructedInterpolants, 0 QuantifiedInterpolants, 239405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...