/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:32:04,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:32:04,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:32:04,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:32:04,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:32:04,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:32:04,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:32:04,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:32:04,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:32:04,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:32:04,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:32:04,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:32:04,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:32:04,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:32:04,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:32:04,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:32:04,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:32:04,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:32:04,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:32:04,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:32:04,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:32:04,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:32:04,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:32:04,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:32:04,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:32:04,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:32:04,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:32:04,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:32:04,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:32:04,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:32:04,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:32:04,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:32:04,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:32:04,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:32:04,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:32:04,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:32:04,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:32:04,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:32:04,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:32:04,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:32:04,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:32:04,892 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.epf [2019-12-27 02:32:04,914 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:32:04,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:32:04,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:32:04,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:32:04,916 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:32:04,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:32:04,917 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:32:04,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:32:04,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:32:04,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:32:04,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:32:04,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:32:04,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:32:04,918 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:32:04,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:32:04,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:32:04,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:32:04,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:32:04,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:32:04,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:32:04,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:32:04,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:32:04,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:32:04,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:32:04,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:32:04,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:32:04,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:32:04,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:32:04,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:32:05,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:32:05,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:32:05,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:32:05,211 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:32:05,212 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:32:05,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-27 02:32:05,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96d5d3c/15c32fba91bc4b9bb91cac1ec0ba8998/FLAG6c2752385 [2019-12-27 02:32:05,884 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:32:05,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-27 02:32:05,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96d5d3c/15c32fba91bc4b9bb91cac1ec0ba8998/FLAG6c2752385 [2019-12-27 02:32:06,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96d5d3c/15c32fba91bc4b9bb91cac1ec0ba8998 [2019-12-27 02:32:06,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:32:06,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:32:06,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:32:06,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:32:06,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:32:06,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06, skipping insertion in model container [2019-12-27 02:32:06,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:32:06,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:32:06,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:32:06,721 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:32:06,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:32:06,889 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:32:06,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06 WrapperNode [2019-12-27 02:32:06,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:32:06,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:32:06,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:32:06,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:32:06,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:32:06,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:32:06,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:32:06,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:32:06,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (1/1) ... [2019-12-27 02:32:06,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:32:06,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:32:06,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:32:06,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:32:06,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (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 02:32:07,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:32:07,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:32:07,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:32:07,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:32:07,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:32:07,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:32:07,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:32:07,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:32:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:32:07,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:32:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:32:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:32:07,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:32:07,085 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 02:32:07,836 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:32:07,836 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:32:07,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:32:07 BoogieIcfgContainer [2019-12-27 02:32:07,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:32:07,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:32:07,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:32:07,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:32:07,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:32:06" (1/3) ... [2019-12-27 02:32:07,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489d8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:32:07, skipping insertion in model container [2019-12-27 02:32:07,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:32:06" (2/3) ... [2019-12-27 02:32:07,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489d8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:32:07, skipping insertion in model container [2019-12-27 02:32:07,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:32:07" (3/3) ... [2019-12-27 02:32:07,847 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.oepc.i [2019-12-27 02:32:07,857 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:32:07,857 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:32:07,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:32:07,866 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:32:07,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,921 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,921 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,976 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,990 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:07,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:32:08,009 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:32:08,033 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:32:08,033 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:32:08,033 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:32:08,033 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:32:08,034 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:32:08,034 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:32:08,034 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:32:08,034 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:32:08,054 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 02:32:08,055 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 02:32:08,169 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 02:32:08,170 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:32:08,190 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 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:32:08,214 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 02:32:08,276 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 02:32:08,276 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:32:08,284 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 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:32:08,305 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:32:08,306 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:32:13,754 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 02:32:13,863 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 02:32:14,191 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 02:32:14,308 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 02:32:14,341 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-27 02:32:14,342 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 02:32:14,345 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 02:32:28,045 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 02:32:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 02:32:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:32:28,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:32:28,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:32:28,054 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 02:32:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:32:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-27 02:32:28,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:32:28,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584991524] [2019-12-27 02:32:28,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:32:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:32:28,372 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 02:32:28,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584991524] [2019-12-27 02:32:28,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:32:28,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:32:28,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552783339] [2019-12-27 02:32:28,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:32:28,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:32:28,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:32:28,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:32:28,400 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 02:32:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:32:29,547 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-27 02:32:29,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:32:29,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:32:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:32:32,933 INFO L225 Difference]: With dead ends: 101544 [2019-12-27 02:32:32,933 INFO L226 Difference]: Without dead ends: 95304 [2019-12-27 02:32:32,935 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 02:32:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-27 02:32:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-27 02:32:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-27 02:32:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-27 02:32:40,972 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-27 02:32:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:32:40,972 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-27 02:32:40,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:32:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-27 02:32:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:32:40,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:32:40,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:32:40,977 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 02:32:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:32:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-27 02:32:40,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:32:40,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082118390] [2019-12-27 02:32:40,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:32:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:32:41,085 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 02:32:41,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082118390] [2019-12-27 02:32:41,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:32:41,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:32:41,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96141419] [2019-12-27 02:32:41,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:32:41,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:32:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:32:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:32:41,090 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-27 02:32:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:32:45,793 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-27 02:32:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:32:45,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:32:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:32:46,391 INFO L225 Difference]: With dead ends: 152040 [2019-12-27 02:32:46,391 INFO L226 Difference]: Without dead ends: 151991 [2019-12-27 02:32:46,392 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 02:32:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-27 02:32:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-27 02:32:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-27 02:33:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-27 02:33:02,787 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-27 02:33:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:02,787 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-27 02:33:02,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-27 02:33:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:33:02,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:02,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:02,797 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 02:33:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-27 02:33:02,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:02,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818722070] [2019-12-27 02:33:02,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:02,885 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 02:33:02,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818722070] [2019-12-27 02:33:02,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:02,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:33:02,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817302294] [2019-12-27 02:33:02,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:02,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:02,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:02,888 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-27 02:33:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:03,025 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-27 02:33:03,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:03,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:33:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:03,077 INFO L225 Difference]: With dead ends: 30915 [2019-12-27 02:33:03,078 INFO L226 Difference]: Without dead ends: 30915 [2019-12-27 02:33:03,078 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 02:33:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-27 02:33:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-27 02:33:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-27 02:33:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-27 02:33:03,669 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-27 02:33:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:03,670 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-27 02:33:03,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-27 02:33:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:33:03,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:03,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:03,674 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 02:33:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-27 02:33:03,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:03,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28687966] [2019-12-27 02:33:03,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:03,752 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 02:33:03,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28687966] [2019-12-27 02:33:03,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:03,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:33:03,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515684131] [2019-12-27 02:33:03,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:03,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:03,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:03,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:03,757 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-27 02:33:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:04,105 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-27 02:33:04,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:33:04,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:33:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:04,167 INFO L225 Difference]: With dead ends: 38538 [2019-12-27 02:33:04,167 INFO L226 Difference]: Without dead ends: 38538 [2019-12-27 02:33:04,168 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 02:33:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-27 02:33:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-27 02:33:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-27 02:33:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-27 02:33:06,144 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-27 02:33:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:06,145 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-27 02:33:06,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-27 02:33:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:33:06,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:06,161 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 02:33:06,161 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 02:33:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-27 02:33:06,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:06,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237693940] [2019-12-27 02:33:06,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:06,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237693940] [2019-12-27 02:33:06,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:06,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:06,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404874399] [2019-12-27 02:33:06,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:33:06,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:33:06,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:06,254 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-27 02:33:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:06,845 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-27 02:33:06,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:33:06,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:33:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:06,916 INFO L225 Difference]: With dead ends: 44779 [2019-12-27 02:33:06,916 INFO L226 Difference]: Without dead ends: 44772 [2019-12-27 02:33:06,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-27 02:33:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-27 02:33:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-27 02:33:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-27 02:33:07,563 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-27 02:33:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:07,563 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-27 02:33:07,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:33:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-27 02:33:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:33:07,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:07,578 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 02:33:07,578 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 02:33:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-27 02:33:07,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:07,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806387594] [2019-12-27 02:33:07,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:07,640 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 02:33:07,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806387594] [2019-12-27 02:33:07,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:07,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:07,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321425056] [2019-12-27 02:33:07,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:07,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:07,643 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-27 02:33:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:07,716 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-27 02:33:07,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:33:07,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:33:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:07,736 INFO L225 Difference]: With dead ends: 13768 [2019-12-27 02:33:07,736 INFO L226 Difference]: Without dead ends: 13768 [2019-12-27 02:33:07,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-27 02:33:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-27 02:33:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-27 02:33:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-27 02:33:07,938 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-27 02:33:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:07,938 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-27 02:33:07,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-27 02:33:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:33:07,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:07,953 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 02:33:07,953 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 02:33:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-27 02:33:07,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:07,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394591652] [2019-12-27 02:33:07,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:08,004 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 02:33:08,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394591652] [2019-12-27 02:33:08,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:08,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:08,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51305005] [2019-12-27 02:33:08,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:08,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:08,007 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-27 02:33:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:08,097 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-27 02:33:08,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:08,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:33:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:08,123 INFO L225 Difference]: With dead ends: 19309 [2019-12-27 02:33:08,123 INFO L226 Difference]: Without dead ends: 19309 [2019-12-27 02:33:08,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-27 02:33:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-27 02:33:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-27 02:33:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-27 02:33:09,029 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-27 02:33:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:09,030 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-27 02:33:09,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-27 02:33:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:33:09,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:09,039 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 02:33:09,040 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 02:33:09,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-27 02:33:09,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:09,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697031591] [2019-12-27 02:33:09,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:09,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697031591] [2019-12-27 02:33:09,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:09,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:09,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179524757] [2019-12-27 02:33:09,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:09,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:09,079 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-27 02:33:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:09,179 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-27 02:33:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:09,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:33:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:09,206 INFO L225 Difference]: With dead ends: 21037 [2019-12-27 02:33:09,206 INFO L226 Difference]: Without dead ends: 21037 [2019-12-27 02:33:09,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-27 02:33:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-27 02:33:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-27 02:33:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-27 02:33:09,474 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-27 02:33:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:09,475 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-27 02:33:09,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-27 02:33:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:33:09,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:09,487 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 02:33:09,487 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 02:33:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-27 02:33:09,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:09,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423977490] [2019-12-27 02:33:09,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:09,581 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 02:33:09,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423977490] [2019-12-27 02:33:09,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:09,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:33:09,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86365755] [2019-12-27 02:33:09,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:33:09,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:33:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:33:09,583 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-27 02:33:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:10,164 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-27 02:33:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:33:10,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:33:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:10,206 INFO L225 Difference]: With dead ends: 29609 [2019-12-27 02:33:10,206 INFO L226 Difference]: Without dead ends: 29609 [2019-12-27 02:33:10,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-27 02:33:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-27 02:33:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-27 02:33:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-27 02:33:10,554 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-27 02:33:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:10,555 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-27 02:33:10,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:33:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-27 02:33:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:33:10,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:10,568 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 02:33:10,568 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 02:33:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-27 02:33:10,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:10,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945752288] [2019-12-27 02:33:10,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:10,696 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 02:33:10,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945752288] [2019-12-27 02:33:10,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:10,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:33:10,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171245745] [2019-12-27 02:33:10,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:33:10,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:10,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:33:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:33:10,698 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-27 02:33:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:11,287 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-27 02:33:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:33:11,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 02:33:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:11,328 INFO L225 Difference]: With dead ends: 28968 [2019-12-27 02:33:11,328 INFO L226 Difference]: Without dead ends: 28968 [2019-12-27 02:33:11,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-27 02:33:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-27 02:33:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-27 02:33:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-27 02:33:11,669 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-27 02:33:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:11,670 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-27 02:33:11,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:33:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-27 02:33:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:33:11,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:11,689 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 02:33:11,689 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 02:33:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-27 02:33:11,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:11,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395882116] [2019-12-27 02:33:11,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:11,787 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 02:33:11,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395882116] [2019-12-27 02:33:11,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:11,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:33:11,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009972735] [2019-12-27 02:33:11,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:11,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:11,789 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-27 02:33:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:14,294 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-27 02:33:14,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:33:14,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:33:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:14,348 INFO L225 Difference]: With dead ends: 38372 [2019-12-27 02:33:14,348 INFO L226 Difference]: Without dead ends: 38372 [2019-12-27 02:33:14,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:33:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-27 02:33:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-27 02:33:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-27 02:33:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-27 02:33:14,776 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-27 02:33:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:14,776 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-27 02:33:14,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-27 02:33:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:33:14,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:14,796 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 02:33:14,796 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 02:33:14,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-27 02:33:14,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:14,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184001727] [2019-12-27 02:33:14,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:14,909 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 02:33:14,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184001727] [2019-12-27 02:33:14,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:14,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:33:14,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475162195] [2019-12-27 02:33:14,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:33:14,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:33:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:33:14,912 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-27 02:33:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:16,685 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-27 02:33:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:33:16,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 02:33:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:16,758 INFO L225 Difference]: With dead ends: 45317 [2019-12-27 02:33:16,758 INFO L226 Difference]: Without dead ends: 45317 [2019-12-27 02:33:16,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:33:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-27 02:33:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-27 02:33:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-27 02:33:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-27 02:33:17,440 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-27 02:33:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:17,440 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-27 02:33:17,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:33:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-27 02:33:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:33:17,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:17,457 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 02:33:17,458 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 02:33:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-27 02:33:17,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:17,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885077070] [2019-12-27 02:33:17,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:17,639 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 02:33:17,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885077070] [2019-12-27 02:33:17,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:17,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:33:17,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444621507] [2019-12-27 02:33:17,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:17,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:17,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:17,643 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-27 02:33:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:18,967 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-27 02:33:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:33:18,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 02:33:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:19,017 INFO L225 Difference]: With dead ends: 34977 [2019-12-27 02:33:19,017 INFO L226 Difference]: Without dead ends: 34977 [2019-12-27 02:33:19,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:33:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-27 02:33:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-27 02:33:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-27 02:33:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-27 02:33:19,407 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-27 02:33:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:19,407 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-27 02:33:19,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-27 02:33:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:33:19,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:19,424 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 02:33:19,424 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 02:33:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-27 02:33:19,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:19,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451897144] [2019-12-27 02:33:19,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:19,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451897144] [2019-12-27 02:33:19,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:19,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:33:19,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829068275] [2019-12-27 02:33:19,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:19,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:19,524 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 7 states. [2019-12-27 02:33:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:20,789 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-27 02:33:20,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:33:20,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 02:33:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:20,850 INFO L225 Difference]: With dead ends: 43257 [2019-12-27 02:33:20,850 INFO L226 Difference]: Without dead ends: 43257 [2019-12-27 02:33:20,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:33:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-27 02:33:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-27 02:33:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-27 02:33:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-27 02:33:21,474 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-27 02:33:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:21,474 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-27 02:33:21,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-27 02:33:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:33:21,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:21,490 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 02:33:21,490 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 02:33:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-27 02:33:21,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:21,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612065033] [2019-12-27 02:33:21,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:21,615 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 02:33:21,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612065033] [2019-12-27 02:33:21,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:21,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:33:21,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540358616] [2019-12-27 02:33:21,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:33:21,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:33:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:33:21,616 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-27 02:33:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:23,316 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-27 02:33:23,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:33:23,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 02:33:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:23,387 INFO L225 Difference]: With dead ends: 39307 [2019-12-27 02:33:23,387 INFO L226 Difference]: Without dead ends: 39307 [2019-12-27 02:33:23,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:33:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-27 02:33:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-27 02:33:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-27 02:33:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-27 02:33:23,785 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-27 02:33:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:23,785 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-27 02:33:23,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:33:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-27 02:33:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:33:23,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:23,807 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 02:33:23,807 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 02:33:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-27 02:33:23,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:23,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898509013] [2019-12-27 02:33:23,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:23,872 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 02:33:23,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898509013] [2019-12-27 02:33:23,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:23,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:33:23,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070515614] [2019-12-27 02:33:23,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:23,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:23,874 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-27 02:33:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:23,938 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-27 02:33:23,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:23,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:33:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:23,961 INFO L225 Difference]: With dead ends: 16672 [2019-12-27 02:33:23,961 INFO L226 Difference]: Without dead ends: 16672 [2019-12-27 02:33:23,961 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 02:33:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-27 02:33:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-27 02:33:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-27 02:33:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-27 02:33:24,199 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-27 02:33:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:24,200 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-27 02:33:24,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-27 02:33:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:33:24,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:24,222 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 02:33:24,223 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 02:33:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-27 02:33:24,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:24,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064584439] [2019-12-27 02:33:24,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:24,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064584439] [2019-12-27 02:33:24,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:24,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:33:24,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639315270] [2019-12-27 02:33:24,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:33:24,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:33:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:24,323 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-27 02:33:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:24,954 INFO L93 Difference]: Finished difference Result 27362 states and 80459 transitions. [2019-12-27 02:33:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:33:24,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:33:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:24,992 INFO L225 Difference]: With dead ends: 27362 [2019-12-27 02:33:24,992 INFO L226 Difference]: Without dead ends: 27362 [2019-12-27 02:33:24,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27362 states. [2019-12-27 02:33:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27362 to 21734. [2019-12-27 02:33:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-27 02:33:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64728 transitions. [2019-12-27 02:33:25,484 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64728 transitions. Word has length 40 [2019-12-27 02:33:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:25,484 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64728 transitions. [2019-12-27 02:33:25,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:33:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64728 transitions. [2019-12-27 02:33:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:33:25,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:25,508 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 02:33:25,508 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 02:33:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-27 02:33:25,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:25,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202718143] [2019-12-27 02:33:25,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:25,558 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 02:33:25,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202718143] [2019-12-27 02:33:25,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:25,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:33:25,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480066420] [2019-12-27 02:33:25,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:33:25,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:33:25,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:25,565 INFO L87 Difference]: Start difference. First operand 21734 states and 64728 transitions. Second operand 5 states. [2019-12-27 02:33:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:25,656 INFO L93 Difference]: Finished difference Result 20430 states and 61764 transitions. [2019-12-27 02:33:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:33:25,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:33:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:25,685 INFO L225 Difference]: With dead ends: 20430 [2019-12-27 02:33:25,685 INFO L226 Difference]: Without dead ends: 20430 [2019-12-27 02:33:25,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2019-12-27 02:33:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 19562. [2019-12-27 02:33:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19562 states. [2019-12-27 02:33:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19562 states to 19562 states and 59424 transitions. [2019-12-27 02:33:25,988 INFO L78 Accepts]: Start accepts. Automaton has 19562 states and 59424 transitions. Word has length 40 [2019-12-27 02:33:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:25,988 INFO L462 AbstractCegarLoop]: Abstraction has 19562 states and 59424 transitions. [2019-12-27 02:33:25,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:33:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19562 states and 59424 transitions. [2019-12-27 02:33:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:26,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:26,011 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 02:33:26,011 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 02:33:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash -628796059, now seen corresponding path program 1 times [2019-12-27 02:33:26,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:26,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634823009] [2019-12-27 02:33:26,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:26,109 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 02:33:26,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634823009] [2019-12-27 02:33:26,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:26,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:33:26,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832360715] [2019-12-27 02:33:26,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:33:26,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:33:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:33:26,112 INFO L87 Difference]: Start difference. First operand 19562 states and 59424 transitions. Second operand 8 states. [2019-12-27 02:33:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:27,390 INFO L93 Difference]: Finished difference Result 91773 states and 275275 transitions. [2019-12-27 02:33:27,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:33:27,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 02:33:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:27,482 INFO L225 Difference]: With dead ends: 91773 [2019-12-27 02:33:27,482 INFO L226 Difference]: Without dead ends: 65597 [2019-12-27 02:33:27,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 02:33:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65597 states. [2019-12-27 02:33:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65597 to 23373. [2019-12-27 02:33:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23373 states. [2019-12-27 02:33:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 71220 transitions. [2019-12-27 02:33:28,411 INFO L78 Accepts]: Start accepts. Automaton has 23373 states and 71220 transitions. Word has length 64 [2019-12-27 02:33:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:28,411 INFO L462 AbstractCegarLoop]: Abstraction has 23373 states and 71220 transitions. [2019-12-27 02:33:28,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:33:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 23373 states and 71220 transitions. [2019-12-27 02:33:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:28,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:28,438 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 02:33:28,439 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 02:33:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 637274751, now seen corresponding path program 2 times [2019-12-27 02:33:28,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:28,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670971588] [2019-12-27 02:33:28,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:28,524 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 02:33:28,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670971588] [2019-12-27 02:33:28,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:28,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:33:28,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642977996] [2019-12-27 02:33:28,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:28,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:28,526 INFO L87 Difference]: Start difference. First operand 23373 states and 71220 transitions. Second operand 7 states. [2019-12-27 02:33:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:29,069 INFO L93 Difference]: Finished difference Result 62216 states and 186100 transitions. [2019-12-27 02:33:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:33:29,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:33:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:29,133 INFO L225 Difference]: With dead ends: 62216 [2019-12-27 02:33:29,133 INFO L226 Difference]: Without dead ends: 45804 [2019-12-27 02:33:29,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:33:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45804 states. [2019-12-27 02:33:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45804 to 27436. [2019-12-27 02:33:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27436 states. [2019-12-27 02:33:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27436 states to 27436 states and 83052 transitions. [2019-12-27 02:33:29,686 INFO L78 Accepts]: Start accepts. Automaton has 27436 states and 83052 transitions. Word has length 64 [2019-12-27 02:33:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:29,687 INFO L462 AbstractCegarLoop]: Abstraction has 27436 states and 83052 transitions. [2019-12-27 02:33:29,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27436 states and 83052 transitions. [2019-12-27 02:33:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:29,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:29,717 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 02:33:29,717 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 02:33:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 3 times [2019-12-27 02:33:29,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:29,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139437461] [2019-12-27 02:33:29,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:29,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139437461] [2019-12-27 02:33:29,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:29,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:33:29,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586985671] [2019-12-27 02:33:29,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:33:29,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:33:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:29,860 INFO L87 Difference]: Start difference. First operand 27436 states and 83052 transitions. Second operand 9 states. [2019-12-27 02:33:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:31,541 INFO L93 Difference]: Finished difference Result 113274 states and 335950 transitions. [2019-12-27 02:33:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:33:31,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:33:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:31,703 INFO L225 Difference]: With dead ends: 113274 [2019-12-27 02:33:31,703 INFO L226 Difference]: Without dead ends: 108630 [2019-12-27 02:33:31,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:33:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108630 states. [2019-12-27 02:33:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108630 to 27989. [2019-12-27 02:33:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27989 states. [2019-12-27 02:33:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27989 states to 27989 states and 84776 transitions. [2019-12-27 02:33:32,719 INFO L78 Accepts]: Start accepts. Automaton has 27989 states and 84776 transitions. Word has length 64 [2019-12-27 02:33:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:32,719 INFO L462 AbstractCegarLoop]: Abstraction has 27989 states and 84776 transitions. [2019-12-27 02:33:32,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:33:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 27989 states and 84776 transitions. [2019-12-27 02:33:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:32,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:32,751 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 02:33:32,751 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 02:33:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:32,751 INFO L82 PathProgramCache]: Analyzing trace with hash -972318627, now seen corresponding path program 4 times [2019-12-27 02:33:32,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:32,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293655704] [2019-12-27 02:33:32,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:32,865 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 02:33:32,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293655704] [2019-12-27 02:33:32,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:32,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:33:32,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127678037] [2019-12-27 02:33:32,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:33:32,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:33:32,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:32,867 INFO L87 Difference]: Start difference. First operand 27989 states and 84776 transitions. Second operand 9 states. [2019-12-27 02:33:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:34,660 INFO L93 Difference]: Finished difference Result 91424 states and 271569 transitions. [2019-12-27 02:33:34,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:33:34,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:33:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:34,778 INFO L225 Difference]: With dead ends: 91424 [2019-12-27 02:33:34,778 INFO L226 Difference]: Without dead ends: 87972 [2019-12-27 02:33:34,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:33:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87972 states. [2019-12-27 02:33:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87972 to 27789. [2019-12-27 02:33:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27789 states. [2019-12-27 02:33:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27789 states to 27789 states and 84305 transitions. [2019-12-27 02:33:35,617 INFO L78 Accepts]: Start accepts. Automaton has 27789 states and 84305 transitions. Word has length 64 [2019-12-27 02:33:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:35,617 INFO L462 AbstractCegarLoop]: Abstraction has 27789 states and 84305 transitions. [2019-12-27 02:33:35,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:33:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27789 states and 84305 transitions. [2019-12-27 02:33:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:35,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:35,647 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 02:33:35,648 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 02:33:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 5 times [2019-12-27 02:33:35,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:35,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415538905] [2019-12-27 02:33:35,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:35,722 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 02:33:35,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415538905] [2019-12-27 02:33:35,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:35,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:33:35,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962266235] [2019-12-27 02:33:35,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:35,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:35,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:35,724 INFO L87 Difference]: Start difference. First operand 27789 states and 84305 transitions. Second operand 7 states. [2019-12-27 02:33:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:36,333 INFO L93 Difference]: Finished difference Result 58989 states and 175462 transitions. [2019-12-27 02:33:36,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:33:36,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:33:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:36,432 INFO L225 Difference]: With dead ends: 58989 [2019-12-27 02:33:36,432 INFO L226 Difference]: Without dead ends: 49515 [2019-12-27 02:33:36,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:33:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49515 states. [2019-12-27 02:33:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49515 to 28125. [2019-12-27 02:33:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28125 states. [2019-12-27 02:33:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28125 states to 28125 states and 85287 transitions. [2019-12-27 02:33:37,084 INFO L78 Accepts]: Start accepts. Automaton has 28125 states and 85287 transitions. Word has length 64 [2019-12-27 02:33:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:37,084 INFO L462 AbstractCegarLoop]: Abstraction has 28125 states and 85287 transitions. [2019-12-27 02:33:37,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 28125 states and 85287 transitions. [2019-12-27 02:33:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:37,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:37,116 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 02:33:37,116 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 02:33:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -520581691, now seen corresponding path program 6 times [2019-12-27 02:33:37,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:37,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485942706] [2019-12-27 02:33:37,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:37,220 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 02:33:37,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485942706] [2019-12-27 02:33:37,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:37,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:33:37,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973712842] [2019-12-27 02:33:37,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:37,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:37,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:37,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:37,222 INFO L87 Difference]: Start difference. First operand 28125 states and 85287 transitions. Second operand 7 states. [2019-12-27 02:33:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:38,955 INFO L93 Difference]: Finished difference Result 52488 states and 157602 transitions. [2019-12-27 02:33:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:33:38,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:33:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:39,033 INFO L225 Difference]: With dead ends: 52488 [2019-12-27 02:33:39,033 INFO L226 Difference]: Without dead ends: 52488 [2019-12-27 02:33:39,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:33:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52488 states. [2019-12-27 02:33:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52488 to 28461. [2019-12-27 02:33:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-27 02:33:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 86415 transitions. [2019-12-27 02:33:39,672 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 86415 transitions. Word has length 64 [2019-12-27 02:33:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:39,672 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 86415 transitions. [2019-12-27 02:33:39,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 86415 transitions. [2019-12-27 02:33:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:39,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:39,706 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 02:33:39,706 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 02:33:39,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:39,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 7 times [2019-12-27 02:33:39,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:39,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711932024] [2019-12-27 02:33:39,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:39,852 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 02:33:39,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711932024] [2019-12-27 02:33:39,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:39,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:33:39,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216999943] [2019-12-27 02:33:39,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:33:39,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:33:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:33:39,854 INFO L87 Difference]: Start difference. First operand 28461 states and 86415 transitions. Second operand 8 states. [2019-12-27 02:33:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:41,730 INFO L93 Difference]: Finished difference Result 56163 states and 169173 transitions. [2019-12-27 02:33:41,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:33:41,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 02:33:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:41,814 INFO L225 Difference]: With dead ends: 56163 [2019-12-27 02:33:41,814 INFO L226 Difference]: Without dead ends: 56163 [2019-12-27 02:33:41,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:33:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56163 states. [2019-12-27 02:33:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56163 to 28489. [2019-12-27 02:33:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28489 states. [2019-12-27 02:33:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28489 states to 28489 states and 86495 transitions. [2019-12-27 02:33:42,759 INFO L78 Accepts]: Start accepts. Automaton has 28489 states and 86495 transitions. Word has length 64 [2019-12-27 02:33:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:42,759 INFO L462 AbstractCegarLoop]: Abstraction has 28489 states and 86495 transitions. [2019-12-27 02:33:42,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:33:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28489 states and 86495 transitions. [2019-12-27 02:33:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:33:42,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:42,792 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 02:33:42,793 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 02:33:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2090754765, now seen corresponding path program 8 times [2019-12-27 02:33:42,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:42,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603774266] [2019-12-27 02:33:42,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:42,857 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 02:33:42,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603774266] [2019-12-27 02:33:42,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:42,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:33:42,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314660698] [2019-12-27 02:33:42,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:42,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:42,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:42,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:42,860 INFO L87 Difference]: Start difference. First operand 28489 states and 86495 transitions. Second operand 3 states. [2019-12-27 02:33:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:43,067 INFO L93 Difference]: Finished difference Result 32830 states and 99680 transitions. [2019-12-27 02:33:43,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:43,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:33:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:43,149 INFO L225 Difference]: With dead ends: 32830 [2019-12-27 02:33:43,149 INFO L226 Difference]: Without dead ends: 32830 [2019-12-27 02:33:43,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 02:33:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32830 states. [2019-12-27 02:33:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32830 to 28660. [2019-12-27 02:33:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28660 states. [2019-12-27 02:33:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 87373 transitions. [2019-12-27 02:33:43,968 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 87373 transitions. Word has length 64 [2019-12-27 02:33:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:43,968 INFO L462 AbstractCegarLoop]: Abstraction has 28660 states and 87373 transitions. [2019-12-27 02:33:43,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 87373 transitions. [2019-12-27 02:33:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:44,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:44,003 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 02:33:44,003 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 02:33:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 984956460, now seen corresponding path program 1 times [2019-12-27 02:33:44,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:44,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736420012] [2019-12-27 02:33:44,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:44,056 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 02:33:44,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736420012] [2019-12-27 02:33:44,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:44,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:33:44,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617603444] [2019-12-27 02:33:44,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:44,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:44,058 INFO L87 Difference]: Start difference. First operand 28660 states and 87373 transitions. Second operand 4 states. [2019-12-27 02:33:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:44,280 INFO L93 Difference]: Finished difference Result 36066 states and 109337 transitions. [2019-12-27 02:33:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:33:44,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:33:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:44,330 INFO L225 Difference]: With dead ends: 36066 [2019-12-27 02:33:44,330 INFO L226 Difference]: Without dead ends: 36066 [2019-12-27 02:33:44,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36066 states. [2019-12-27 02:33:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36066 to 29485. [2019-12-27 02:33:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-27 02:33:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 89840 transitions. [2019-12-27 02:33:44,829 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 89840 transitions. Word has length 65 [2019-12-27 02:33:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:44,829 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 89840 transitions. [2019-12-27 02:33:44,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 89840 transitions. [2019-12-27 02:33:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:44,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:44,860 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 02:33:44,860 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 02:33:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:44,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1689403746, now seen corresponding path program 1 times [2019-12-27 02:33:44,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:44,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767182659] [2019-12-27 02:33:44,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:44,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767182659] [2019-12-27 02:33:44,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:44,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:33:44,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714498427] [2019-12-27 02:33:44,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:33:44,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:33:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:33:44,951 INFO L87 Difference]: Start difference. First operand 29485 states and 89840 transitions. Second operand 8 states. [2019-12-27 02:33:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:46,148 INFO L93 Difference]: Finished difference Result 80928 states and 242282 transitions. [2019-12-27 02:33:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:33:46,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:33:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:46,255 INFO L225 Difference]: With dead ends: 80928 [2019-12-27 02:33:46,255 INFO L226 Difference]: Without dead ends: 74194 [2019-12-27 02:33:46,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:33:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74194 states. [2019-12-27 02:33:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74194 to 29951. [2019-12-27 02:33:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29951 states. [2019-12-27 02:33:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29951 states to 29951 states and 91468 transitions. [2019-12-27 02:33:47,060 INFO L78 Accepts]: Start accepts. Automaton has 29951 states and 91468 transitions. Word has length 65 [2019-12-27 02:33:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:47,060 INFO L462 AbstractCegarLoop]: Abstraction has 29951 states and 91468 transitions. [2019-12-27 02:33:47,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:33:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 29951 states and 91468 transitions. [2019-12-27 02:33:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:47,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:47,092 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 02:33:47,092 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 02:33:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 2 times [2019-12-27 02:33:47,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:47,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840458597] [2019-12-27 02:33:47,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:47,141 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 02:33:47,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840458597] [2019-12-27 02:33:47,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:47,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:33:47,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156700868] [2019-12-27 02:33:47,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:47,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:47,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:47,143 INFO L87 Difference]: Start difference. First operand 29951 states and 91468 transitions. Second operand 4 states. [2019-12-27 02:33:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:47,484 INFO L93 Difference]: Finished difference Result 45778 states and 140292 transitions. [2019-12-27 02:33:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:33:47,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:33:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:47,552 INFO L225 Difference]: With dead ends: 45778 [2019-12-27 02:33:47,552 INFO L226 Difference]: Without dead ends: 45778 [2019-12-27 02:33:47,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 02:33:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45778 states. [2019-12-27 02:33:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45778 to 31406. [2019-12-27 02:33:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2019-12-27 02:33:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 96530 transitions. [2019-12-27 02:33:48,156 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 96530 transitions. Word has length 65 [2019-12-27 02:33:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:48,156 INFO L462 AbstractCegarLoop]: Abstraction has 31406 states and 96530 transitions. [2019-12-27 02:33:48,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 96530 transitions. [2019-12-27 02:33:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:48,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:48,193 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 02:33:48,194 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 02:33:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash -476661734, now seen corresponding path program 2 times [2019-12-27 02:33:48,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:48,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140926510] [2019-12-27 02:33:48,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:48,315 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 02:33:48,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140926510] [2019-12-27 02:33:48,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:48,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:33:48,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721670553] [2019-12-27 02:33:48,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:33:48,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:48,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:33:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:48,316 INFO L87 Difference]: Start difference. First operand 31406 states and 96530 transitions. Second operand 9 states. [2019-12-27 02:33:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:50,154 INFO L93 Difference]: Finished difference Result 103839 states and 309510 transitions. [2019-12-27 02:33:50,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:33:50,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:33:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:50,294 INFO L225 Difference]: With dead ends: 103839 [2019-12-27 02:33:50,294 INFO L226 Difference]: Without dead ends: 93795 [2019-12-27 02:33:50,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:33:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93795 states. [2019-12-27 02:33:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93795 to 31892. [2019-12-27 02:33:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31892 states. [2019-12-27 02:33:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31892 states to 31892 states and 97205 transitions. [2019-12-27 02:33:51,298 INFO L78 Accepts]: Start accepts. Automaton has 31892 states and 97205 transitions. Word has length 65 [2019-12-27 02:33:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:51,298 INFO L462 AbstractCegarLoop]: Abstraction has 31892 states and 97205 transitions. [2019-12-27 02:33:51,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:33:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 31892 states and 97205 transitions. [2019-12-27 02:33:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:51,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:51,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:51,335 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 02:33:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -123930860, now seen corresponding path program 3 times [2019-12-27 02:33:51,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:51,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813367529] [2019-12-27 02:33:51,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:51,459 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 02:33:51,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813367529] [2019-12-27 02:33:51,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:51,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:33:51,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985043252] [2019-12-27 02:33:51,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:33:51,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:33:51,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:51,462 INFO L87 Difference]: Start difference. First operand 31892 states and 97205 transitions. Second operand 9 states. [2019-12-27 02:33:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:52,864 INFO L93 Difference]: Finished difference Result 88943 states and 264945 transitions. [2019-12-27 02:33:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:33:52,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:33:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:53,028 INFO L225 Difference]: With dead ends: 88943 [2019-12-27 02:33:53,029 INFO L226 Difference]: Without dead ends: 84511 [2019-12-27 02:33:53,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:33:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84511 states. [2019-12-27 02:33:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84511 to 30537. [2019-12-27 02:33:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30537 states. [2019-12-27 02:33:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30537 states to 30537 states and 93428 transitions. [2019-12-27 02:33:54,220 INFO L78 Accepts]: Start accepts. Automaton has 30537 states and 93428 transitions. Word has length 65 [2019-12-27 02:33:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:54,220 INFO L462 AbstractCegarLoop]: Abstraction has 30537 states and 93428 transitions. [2019-12-27 02:33:54,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:33:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 30537 states and 93428 transitions. [2019-12-27 02:33:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:54,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:54,256 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 02:33:54,257 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:33:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:54,257 INFO L82 PathProgramCache]: Analyzing trace with hash 535036274, now seen corresponding path program 4 times [2019-12-27 02:33:54,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:54,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110291261] [2019-12-27 02:33:54,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:54,383 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 02:33:54,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110291261] [2019-12-27 02:33:54,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:54,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:33:54,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805643359] [2019-12-27 02:33:54,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:54,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:54,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:54,385 INFO L87 Difference]: Start difference. First operand 30537 states and 93428 transitions. Second operand 7 states. [2019-12-27 02:33:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:55,957 INFO L93 Difference]: Finished difference Result 50821 states and 152143 transitions. [2019-12-27 02:33:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:33:55,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:33:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:56,031 INFO L225 Difference]: With dead ends: 50821 [2019-12-27 02:33:56,031 INFO L226 Difference]: Without dead ends: 50821 [2019-12-27 02:33:56,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:33:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50821 states. [2019-12-27 02:33:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50821 to 31006. [2019-12-27 02:33:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31006 states. [2019-12-27 02:33:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31006 states to 31006 states and 94726 transitions. [2019-12-27 02:33:56,675 INFO L78 Accepts]: Start accepts. Automaton has 31006 states and 94726 transitions. Word has length 65 [2019-12-27 02:33:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:56,675 INFO L462 AbstractCegarLoop]: Abstraction has 31006 states and 94726 transitions. [2019-12-27 02:33:56,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31006 states and 94726 transitions. [2019-12-27 02:33:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:56,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:56,711 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 02:33:56,711 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:33:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1794298295, now seen corresponding path program 1 times [2019-12-27 02:33:56,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:56,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582644645] [2019-12-27 02:33:56,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:56,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582644645] [2019-12-27 02:33:56,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:56,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:33:56,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187525937] [2019-12-27 02:33:56,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:33:56,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:33:56,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:56,785 INFO L87 Difference]: Start difference. First operand 31006 states and 94726 transitions. Second operand 5 states. [2019-12-27 02:33:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:57,593 INFO L93 Difference]: Finished difference Result 41644 states and 125022 transitions. [2019-12-27 02:33:57,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:33:57,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 02:33:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:57,650 INFO L225 Difference]: With dead ends: 41644 [2019-12-27 02:33:57,650 INFO L226 Difference]: Without dead ends: 41400 [2019-12-27 02:33:57,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:33:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41400 states. [2019-12-27 02:33:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41400 to 37128. [2019-12-27 02:33:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37128 states. [2019-12-27 02:33:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37128 states to 37128 states and 112464 transitions. [2019-12-27 02:33:58,216 INFO L78 Accepts]: Start accepts. Automaton has 37128 states and 112464 transitions. Word has length 65 [2019-12-27 02:33:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:58,217 INFO L462 AbstractCegarLoop]: Abstraction has 37128 states and 112464 transitions. [2019-12-27 02:33:58,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:33:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 37128 states and 112464 transitions. [2019-12-27 02:33:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:58,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:58,258 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 02:33:58,258 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:33:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-27 02:33:58,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:58,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877043572] [2019-12-27 02:33:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:58,321 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 02:33:58,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877043572] [2019-12-27 02:33:58,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:58,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:58,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010488587] [2019-12-27 02:33:58,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:58,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:58,323 INFO L87 Difference]: Start difference. First operand 37128 states and 112464 transitions. Second operand 4 states. [2019-12-27 02:33:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:58,597 INFO L93 Difference]: Finished difference Result 36756 states and 111117 transitions. [2019-12-27 02:33:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:33:58,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:33:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:58,687 INFO L225 Difference]: With dead ends: 36756 [2019-12-27 02:33:58,688 INFO L226 Difference]: Without dead ends: 36756 [2019-12-27 02:33:58,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36756 states. [2019-12-27 02:33:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36756 to 33005. [2019-12-27 02:33:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33005 states. [2019-12-27 02:33:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33005 states to 33005 states and 99014 transitions. [2019-12-27 02:33:59,328 INFO L78 Accepts]: Start accepts. Automaton has 33005 states and 99014 transitions. Word has length 65 [2019-12-27 02:33:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:59,328 INFO L462 AbstractCegarLoop]: Abstraction has 33005 states and 99014 transitions. [2019-12-27 02:33:59,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 33005 states and 99014 transitions. [2019-12-27 02:33:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:33:59,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:59,365 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 02:33:59,365 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:33:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1586394449, now seen corresponding path program 2 times [2019-12-27 02:33:59,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:59,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458538500] [2019-12-27 02:33:59,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:59,580 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 02:33:59,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458538500] [2019-12-27 02:33:59,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:33:59,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772850091] [2019-12-27 02:33:59,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:33:59,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:33:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:33:59,581 INFO L87 Difference]: Start difference. First operand 33005 states and 99014 transitions. Second operand 10 states. [2019-12-27 02:34:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:01,650 INFO L93 Difference]: Finished difference Result 53357 states and 158647 transitions. [2019-12-27 02:34:01,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:34:01,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 02:34:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:01,728 INFO L225 Difference]: With dead ends: 53357 [2019-12-27 02:34:01,728 INFO L226 Difference]: Without dead ends: 53357 [2019-12-27 02:34:01,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:34:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53357 states. [2019-12-27 02:34:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53357 to 33311. [2019-12-27 02:34:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33311 states. [2019-12-27 02:34:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33311 states to 33311 states and 100145 transitions. [2019-12-27 02:34:02,667 INFO L78 Accepts]: Start accepts. Automaton has 33311 states and 100145 transitions. Word has length 65 [2019-12-27 02:34:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:02,668 INFO L462 AbstractCegarLoop]: Abstraction has 33311 states and 100145 transitions. [2019-12-27 02:34:02,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:34:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 33311 states and 100145 transitions. [2019-12-27 02:34:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:34:02,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:02,706 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 02:34:02,706 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 3 times [2019-12-27 02:34:02,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:02,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813411828] [2019-12-27 02:34:02,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:02,834 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 02:34:02,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813411828] [2019-12-27 02:34:02,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:02,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:34:02,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675410162] [2019-12-27 02:34:02,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:34:02,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:02,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:34:02,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:34:02,836 INFO L87 Difference]: Start difference. First operand 33311 states and 100145 transitions. Second operand 8 states. [2019-12-27 02:34:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:04,828 INFO L93 Difference]: Finished difference Result 63201 states and 186948 transitions. [2019-12-27 02:34:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:34:04,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:34:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:04,919 INFO L225 Difference]: With dead ends: 63201 [2019-12-27 02:34:04,919 INFO L226 Difference]: Without dead ends: 62949 [2019-12-27 02:34:04,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:34:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62949 states. [2019-12-27 02:34:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62949 to 36043. [2019-12-27 02:34:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36043 states. [2019-12-27 02:34:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36043 states to 36043 states and 108060 transitions. [2019-12-27 02:34:05,716 INFO L78 Accepts]: Start accepts. Automaton has 36043 states and 108060 transitions. Word has length 65 [2019-12-27 02:34:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:05,716 INFO L462 AbstractCegarLoop]: Abstraction has 36043 states and 108060 transitions. [2019-12-27 02:34:05,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:34:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36043 states and 108060 transitions. [2019-12-27 02:34:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:34:05,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:05,761 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 02:34:05,761 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1171161157, now seen corresponding path program 4 times [2019-12-27 02:34:05,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:05,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409452315] [2019-12-27 02:34:05,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:34:05,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409452315] [2019-12-27 02:34:05,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:05,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:34:05,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218977106] [2019-12-27 02:34:05,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:34:05,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:05,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:34:05,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:34:05,920 INFO L87 Difference]: Start difference. First operand 36043 states and 108060 transitions. Second operand 10 states. [2019-12-27 02:34:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:09,302 INFO L93 Difference]: Finished difference Result 64167 states and 189672 transitions. [2019-12-27 02:34:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 02:34:09,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 02:34:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:09,392 INFO L225 Difference]: With dead ends: 64167 [2019-12-27 02:34:09,392 INFO L226 Difference]: Without dead ends: 64167 [2019-12-27 02:34:09,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1231, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 02:34:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64167 states. [2019-12-27 02:34:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64167 to 36271. [2019-12-27 02:34:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36271 states. [2019-12-27 02:34:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36271 states to 36271 states and 108406 transitions. [2019-12-27 02:34:10,191 INFO L78 Accepts]: Start accepts. Automaton has 36271 states and 108406 transitions. Word has length 65 [2019-12-27 02:34:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:10,192 INFO L462 AbstractCegarLoop]: Abstraction has 36271 states and 108406 transitions. [2019-12-27 02:34:10,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:34:10,192 INFO L276 IsEmpty]: Start isEmpty. Operand 36271 states and 108406 transitions. [2019-12-27 02:34:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:34:10,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:10,234 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 02:34:10,234 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1095461897, now seen corresponding path program 5 times [2019-12-27 02:34:10,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:10,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038443311] [2019-12-27 02:34:10,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:10,287 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 02:34:10,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038443311] [2019-12-27 02:34:10,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:10,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:10,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223798472] [2019-12-27 02:34:10,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:10,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:10,289 INFO L87 Difference]: Start difference. First operand 36271 states and 108406 transitions. Second operand 3 states. [2019-12-27 02:34:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:10,414 INFO L93 Difference]: Finished difference Result 36271 states and 108405 transitions. [2019-12-27 02:34:10,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:10,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:34:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:10,464 INFO L225 Difference]: With dead ends: 36271 [2019-12-27 02:34:10,464 INFO L226 Difference]: Without dead ends: 36271 [2019-12-27 02:34:10,464 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 02:34:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36271 states. [2019-12-27 02:34:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36271 to 25447. [2019-12-27 02:34:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25447 states. [2019-12-27 02:34:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25447 states to 25447 states and 78113 transitions. [2019-12-27 02:34:10,940 INFO L78 Accepts]: Start accepts. Automaton has 25447 states and 78113 transitions. Word has length 65 [2019-12-27 02:34:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:10,940 INFO L462 AbstractCegarLoop]: Abstraction has 25447 states and 78113 transitions. [2019-12-27 02:34:10,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 25447 states and 78113 transitions. [2019-12-27 02:34:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:34:10,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:10,968 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 02:34:10,968 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:10,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1288264236, now seen corresponding path program 1 times [2019-12-27 02:34:10,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:10,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281102666] [2019-12-27 02:34:10,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:11,013 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 02:34:11,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281102666] [2019-12-27 02:34:11,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:11,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:11,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848078156] [2019-12-27 02:34:11,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:11,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:11,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:11,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:11,015 INFO L87 Difference]: Start difference. First operand 25447 states and 78113 transitions. Second operand 3 states. [2019-12-27 02:34:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:11,126 INFO L93 Difference]: Finished difference Result 20509 states and 61824 transitions. [2019-12-27 02:34:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:11,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:34:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:11,172 INFO L225 Difference]: With dead ends: 20509 [2019-12-27 02:34:11,173 INFO L226 Difference]: Without dead ends: 20509 [2019-12-27 02:34:11,175 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 02:34:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20509 states. [2019-12-27 02:34:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20509 to 18509. [2019-12-27 02:34:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18509 states. [2019-12-27 02:34:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18509 states to 18509 states and 55754 transitions. [2019-12-27 02:34:11,510 INFO L78 Accepts]: Start accepts. Automaton has 18509 states and 55754 transitions. Word has length 66 [2019-12-27 02:34:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:11,511 INFO L462 AbstractCegarLoop]: Abstraction has 18509 states and 55754 transitions. [2019-12-27 02:34:11,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 18509 states and 55754 transitions. [2019-12-27 02:34:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:34:11,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:11,529 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 02:34:11,529 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:11,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-27 02:34:11,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:11,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336812848] [2019-12-27 02:34:11,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:34:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:34:11,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:34:11,656 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:34:11,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1117~0.base_55|) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55| 1) |v_#valid_91|) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1117~0.base_55| 4) |v_#length_25|) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (= |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55|) 0) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55|) |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_41|, ULTIMATE.start_main_~#t1117~0.offset=|v_ULTIMATE.start_main_~#t1117~0.offset_34|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ULTIMATE.start_main_~#t1117~0.base=|v_ULTIMATE.start_main_~#t1117~0.base_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_19|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_75, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_20|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_28|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1117~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t1117~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1118~0.offset, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t1119~0.offset, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ULTIMATE.start_main_~#t1119~0.base, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 02:34:11,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd1~0_Out-1230442807 ~a$r_buff0_thd1~0_In-1230442807) (= ~a$r_buff0_thd3~0_In-1230442807 ~a$r_buff1_thd3~0_Out-1230442807) (= ~a$r_buff0_thd0~0_In-1230442807 ~a$r_buff1_thd0~0_Out-1230442807) (= ~a$r_buff1_thd2~0_Out-1230442807 ~a$r_buff0_thd2~0_In-1230442807) (= ~__unbuffered_p0_EAX~0_Out-1230442807 ~x~0_In-1230442807) (= ~a$r_buff0_thd1~0_Out-1230442807 1) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1230442807 0))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1230442807, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1230442807, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1230442807, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1230442807, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1230442807, ~x~0=~x~0_In-1230442807} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1230442807, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1230442807, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1230442807, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1230442807, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1230442807, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1230442807, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1230442807, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1230442807, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1230442807, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1230442807, ~x~0=~x~0_In-1230442807} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:34:11,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9|) |v_ULTIMATE.start_main_~#t1118~0.offset_7| 1))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1118~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1118~0.base_9| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1118~0.base_9| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1118~0.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1118~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:34:11,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1119~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1119~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) |v_ULTIMATE.start_main_~#t1119~0.offset_8| 2)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1119~0.base_9| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9| 1) |v_#valid_32|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1119~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1119~0.base] because there is no mapped edge [2019-12-27 02:34:11,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1653495013 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1653495013 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1653495013| |P1Thread1of1ForFork2_#t~ite10_Out1653495013|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1653495013| ~a~0_In1653495013) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1653495013| ~a$w_buff1~0_In1653495013)))) InVars {~a~0=~a~0_In1653495013, ~a$w_buff1~0=~a$w_buff1~0_In1653495013, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1653495013, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653495013} OutVars{~a~0=~a~0_In1653495013, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1653495013|, ~a$w_buff1~0=~a$w_buff1~0_In1653495013, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1653495013, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1653495013|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653495013} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 02:34:11,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1082281405 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1082281405 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1082281405| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1082281405| ~a$w_buff0_used~0_In1082281405)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1082281405|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:34:11,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd2~0_In206596393 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In206596393 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In206596393 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In206596393 256) 0))) (or (and (= ~a$w_buff1_used~0_In206596393 |P1Thread1of1ForFork2_#t~ite12_Out206596393|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out206596393| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In206596393, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In206596393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In206596393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In206596393} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In206596393, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In206596393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In206596393, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out206596393|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In206596393} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:34:11,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1323269510 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In1323269510| |P2Thread1of1ForFork0_#t~ite20_Out1323269510|) (= |P2Thread1of1ForFork0_#t~ite21_Out1323269510| ~a$w_buff0~0_In1323269510)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out1323269510| |P2Thread1of1ForFork0_#t~ite21_Out1323269510|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1323269510 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In1323269510 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In1323269510 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1323269510 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out1323269510| ~a$w_buff0~0_In1323269510)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1323269510, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1323269510, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1323269510, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1323269510, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1323269510, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1323269510|, ~weak$$choice2~0=~weak$$choice2~0_In1323269510} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1323269510|, ~a$w_buff0~0=~a$w_buff0~0_In1323269510, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1323269510, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1323269510, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1323269510, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1323269510|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1323269510, ~weak$$choice2~0=~weak$$choice2~0_In1323269510} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 02:34:11,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In700895104 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In700895104 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out700895104|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In700895104 |P1Thread1of1ForFork2_#t~ite13_Out700895104|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700895104, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700895104} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700895104, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700895104, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out700895104|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:34:11,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In159292803 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In159292803 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In159292803 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In159292803 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out159292803| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out159292803| ~a$r_buff1_thd2~0_In159292803)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In159292803, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In159292803, ~a$w_buff0_used~0=~a$w_buff0_used~0_In159292803, ~a$w_buff1_used~0=~a$w_buff1_used~0_In159292803} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In159292803, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In159292803, ~a$w_buff0_used~0=~a$w_buff0_used~0_In159292803, ~a$w_buff1_used~0=~a$w_buff1_used~0_In159292803, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out159292803|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:34:11,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:34:11,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1487066192 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1487066192 |P2Thread1of1ForFork0_#t~ite24_Out-1487066192|) (= |P2Thread1of1ForFork0_#t~ite23_In-1487066192| |P2Thread1of1ForFork0_#t~ite23_Out-1487066192|)) (and (= ~a$w_buff1~0_In-1487066192 |P2Thread1of1ForFork0_#t~ite23_Out-1487066192|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1487066192 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1487066192 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1487066192 256))) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1487066192 256))))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1487066192| |P2Thread1of1ForFork0_#t~ite23_Out-1487066192|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1487066192, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1487066192|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1487066192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1487066192, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1487066192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1487066192, ~weak$$choice2~0=~weak$$choice2~0_In-1487066192} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1487066192, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1487066192|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1487066192|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1487066192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1487066192, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1487066192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1487066192, ~weak$$choice2~0=~weak$$choice2~0_In-1487066192} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 02:34:11,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In894177691 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out894177691| ~a$w_buff0_used~0_In894177691) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In894177691| |P2Thread1of1ForFork0_#t~ite26_Out894177691|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In894177691 256) 0))) (or (= (mod ~a$w_buff0_used~0_In894177691 256) 0) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In894177691 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In894177691 256))))) (= |P2Thread1of1ForFork0_#t~ite27_Out894177691| |P2Thread1of1ForFork0_#t~ite26_Out894177691|) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out894177691| ~a$w_buff0_used~0_In894177691)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In894177691|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In894177691, ~a$w_buff0_used~0=~a$w_buff0_used~0_In894177691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In894177691, ~a$w_buff1_used~0=~a$w_buff1_used~0_In894177691, ~weak$$choice2~0=~weak$$choice2~0_In894177691} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out894177691|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out894177691|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In894177691, ~a$w_buff0_used~0=~a$w_buff0_used~0_In894177691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In894177691, ~a$w_buff1_used~0=~a$w_buff1_used~0_In894177691, ~weak$$choice2~0=~weak$$choice2~0_In894177691} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 02:34:11,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~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|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:34:11,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 02:34:11,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1050655637 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1050655637 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1050655637| ~a$w_buff1~0_In-1050655637) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1050655637| ~a~0_In-1050655637)))) InVars {~a~0=~a~0_In-1050655637, ~a$w_buff1~0=~a$w_buff1~0_In-1050655637, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1050655637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1050655637} OutVars{~a~0=~a~0_In-1050655637, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1050655637|, ~a$w_buff1~0=~a$w_buff1~0_In-1050655637, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1050655637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1050655637} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:34:11,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:34:11,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-164426591 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-164426591 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-164426591| ~a$w_buff0_used~0_In-164426591)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-164426591| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-164426591, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-164426591} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-164426591|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-164426591, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-164426591} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:34:11,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In2110532794 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2110532794 256)))) (or (and (= ~a$w_buff0_used~0_In2110532794 |P0Thread1of1ForFork1_#t~ite5_Out2110532794|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out2110532794|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2110532794} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2110532794|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2110532794} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:34:11,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-773194282 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-773194282 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-773194282 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-773194282 256) 0))) (or (and (= ~a$w_buff1_used~0_In-773194282 |P0Thread1of1ForFork1_#t~ite6_Out-773194282|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-773194282|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-773194282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-773194282, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-773194282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-773194282} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-773194282|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-773194282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-773194282, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-773194282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-773194282} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:34:11,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-611402943 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-611402943 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-611402943)) (and (= ~a$r_buff0_thd1~0_In-611402943 ~a$r_buff0_thd1~0_Out-611402943) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-611402943, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-611402943} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-611402943|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-611402943, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-611402943} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:34:11,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-901255175 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-901255175 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-901255175 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-901255175 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-901255175| ~a$r_buff1_thd1~0_In-901255175)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite8_Out-901255175| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-901255175, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-901255175, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-901255175} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-901255175|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-901255175, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-901255175, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-901255175} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:34:11,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:34:11,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In1742055758 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1742055758 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1742055758 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1742055758 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1742055758| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1742055758| ~a$w_buff1_used~0_In1742055758) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1742055758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742055758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1742055758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742055758} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1742055758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742055758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1742055758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742055758, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1742055758|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:34:11,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-2123046613 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2123046613 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-2123046613| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-2123046613| ~a$r_buff0_thd3~0_In-2123046613) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123046613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2123046613} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123046613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2123046613, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-2123046613|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:34:11,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-700060970 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-700060970 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-700060970 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-700060970 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-700060970| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-700060970 |P2Thread1of1ForFork0_#t~ite43_Out-700060970|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-700060970, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-700060970, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-700060970, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-700060970} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-700060970|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-700060970, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-700060970, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-700060970, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-700060970} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:34:11,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:34:11,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:34:11,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In1113140487 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1113140487 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1113140487| |ULTIMATE.start_main_#t~ite48_Out1113140487|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1113140487| ~a~0_In1113140487) .cse2) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1113140487 |ULTIMATE.start_main_#t~ite47_Out1113140487|) .cse2))) InVars {~a~0=~a~0_In1113140487, ~a$w_buff1~0=~a$w_buff1~0_In1113140487, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1113140487, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1113140487} OutVars{~a~0=~a~0_In1113140487, ~a$w_buff1~0=~a$w_buff1~0_In1113140487, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1113140487|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1113140487, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1113140487|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1113140487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:34:11,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-46152458 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-46152458 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-46152458|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-46152458| ~a$w_buff0_used~0_In-46152458) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-46152458, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-46152458} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-46152458, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-46152458|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-46152458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:34:11,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-293296695 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-293296695 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-293296695 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-293296695 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-293296695 |ULTIMATE.start_main_#t~ite50_Out-293296695|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-293296695|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-293296695, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-293296695, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-293296695, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-293296695} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-293296695|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-293296695, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-293296695, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-293296695, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-293296695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:34:11,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In493896588 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In493896588 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out493896588| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out493896588| ~a$r_buff0_thd0~0_In493896588) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In493896588} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out493896588|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In493896588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:34:11,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1456301977 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1456301977 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1456301977 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1456301977 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1456301977| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1456301977| ~a$r_buff1_thd0~0_In-1456301977) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1456301977, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1456301977, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1456301977} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1456301977|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1456301977, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1456301977, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1456301977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:34:11,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, 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, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:34:11,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:34:11 BasicIcfg [2019-12-27 02:34:11,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:34:11,971 INFO L168 Benchmark]: Toolchain (without parser) took 125818.62 ms. Allocated memory was 145.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 02:34:11,971 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:34:11,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.98 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 156.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:11,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.40 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:11,972 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:11,973 INFO L168 Benchmark]: RCFGBuilder took 842.33 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 100.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:11,973 INFO L168 Benchmark]: TraceAbstraction took 124130.30 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 02:34:11,975 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.70 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.98 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 156.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.40 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.91 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.33 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 100.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124130.30 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 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(&t1117, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1118, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1119, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.6s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 49.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10063 SDtfs, 15046 SDslu, 28791 SDs, 0 SdLazy, 19960 SolverSat, 911 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 143 SyntacticMatches, 27 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 48.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 751904 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1911 NumberOfCodeBlocks, 1911 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 350953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...