/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:38:31,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:38:31,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:38:31,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:38:31,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:38:31,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:38:31,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:38:31,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:38:31,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:38:31,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:38:31,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:38:31,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:38:31,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:38:31,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:38:31,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:38:31,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:38:31,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:38:31,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:38:31,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:38:31,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:38:31,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:38:31,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:38:31,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:38:31,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:38:31,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:38:31,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:38:31,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:38:31,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:38:31,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:38:31,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:38:31,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:38:31,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:38:31,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:38:31,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:38:31,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:38:31,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:38:31,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:38:31,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:38:31,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:38:31,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:38:31,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:38:31,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:38:31,933 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:38:31,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:38:31,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:38:31,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:38:31,938 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:38:31,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:38:31,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:38:31,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:38:31,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:38:31,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:38:31,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:38:31,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:38:31,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:38:31,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:38:31,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:38:31,940 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:38:31,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:38:31,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:38:31,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:38:31,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:38:31,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:38:31,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:38:31,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:38:31,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:38:31,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:38:31,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:38:31,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:38:31,947 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:38:31,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:38:31,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:38:32,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:38:32,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:38:32,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:38:32,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:38:32,251 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:38:32,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i [2019-12-27 07:38:32,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b38b3b/5d5ea00bf6e6418da2575d08d3a9345a/FLAG0f29b2cb3 [2019-12-27 07:38:32,862 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:38:32,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i [2019-12-27 07:38:32,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b38b3b/5d5ea00bf6e6418da2575d08d3a9345a/FLAG0f29b2cb3 [2019-12-27 07:38:33,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b38b3b/5d5ea00bf6e6418da2575d08d3a9345a [2019-12-27 07:38:33,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:38:33,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:38:33,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:38:33,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:38:33,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:38:33,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2a7ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33, skipping insertion in model container [2019-12-27 07:38:33,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:38:33,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:38:33,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:38:33,714 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:38:33,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:38:33,860 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:38:33,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33 WrapperNode [2019-12-27 07:38:33,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:38:33,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:38:33,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:38:33,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:38:33,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:38:33,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:38:33,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:38:33,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:38:33,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:38:33,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:38:33,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:38:33,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:38:33,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (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 07:38:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:38:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:38:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:38:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:38:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:38:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:38:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:38:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:38:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:38:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:38:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:38:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:38:34,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:38:34,051 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 07:38:34,842 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:38:34,843 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:38:34,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:34 BoogieIcfgContainer [2019-12-27 07:38:34,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:38:34,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:38:34,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:38:34,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:38:34,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:38:33" (1/3) ... [2019-12-27 07:38:34,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35dabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:34, skipping insertion in model container [2019-12-27 07:38:34,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (2/3) ... [2019-12-27 07:38:34,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35dabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:34, skipping insertion in model container [2019-12-27 07:38:34,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:34" (3/3) ... [2019-12-27 07:38:34,856 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.opt.i [2019-12-27 07:38:34,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:38:34,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:38:34,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:38:34,873 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:38:34,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,965 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,965 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:35,003 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:38:35,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:38:35,022 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:38:35,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:38:35,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:38:35,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:38:35,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:38:35,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:38:35,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:38:35,040 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 07:38:35,042 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:38:35,143 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:38:35,143 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:38:35,162 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:38:35,183 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:38:35,267 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:38:35,268 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:38:35,275 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:38:35,296 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:38:35,297 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:38:38,336 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-27 07:38:38,935 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:38:39,081 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:38:39,165 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-27 07:38:39,166 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 07:38:39,169 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 07:38:53,005 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 07:38:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 07:38:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:38:53,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:53,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:38:53,015 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:38:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-27 07:38:53,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:53,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977592670] [2019-12-27 07:38:53,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:53,256 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 07:38:53,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977592670] [2019-12-27 07:38:53,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:53,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:38:53,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369574590] [2019-12-27 07:38:53,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:38:53,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:53,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:38:53,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:38:53,284 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 07:38:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:56,736 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 07:38:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:38:56,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:38:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:57,305 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 07:38:57,305 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 07:38:57,306 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 07:39:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 07:39:02,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 07:39:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 07:39:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 07:39:03,239 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 07:39:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:03,240 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 07:39:03,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 07:39:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:39:03,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:03,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:03,254 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:03,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-27 07:39:03,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:03,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172118552] [2019-12-27 07:39:03,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:03,402 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 07:39:03,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172118552] [2019-12-27 07:39:03,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:03,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:03,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296393788] [2019-12-27 07:39:03,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:03,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:03,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:03,405 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 07:39:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:07,416 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 07:39:07,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:07,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:39:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:08,037 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 07:39:08,038 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 07:39:08,038 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 07:39:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 07:39:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 07:39:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 07:39:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 07:39:21,346 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 07:39:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:21,348 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 07:39:21,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 07:39:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:39:21,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:21,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:21,352 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-27 07:39:21,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:21,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628124297] [2019-12-27 07:39:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:21,474 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 07:39:21,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628124297] [2019-12-27 07:39:21,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:21,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:21,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351111073] [2019-12-27 07:39:21,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:21,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:21,476 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 07:39:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:21,639 INFO L93 Difference]: Finished difference Result 37434 states and 130812 transitions. [2019-12-27 07:39:21,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:39:21,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:39:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:21,713 INFO L225 Difference]: With dead ends: 37434 [2019-12-27 07:39:21,713 INFO L226 Difference]: Without dead ends: 29372 [2019-12-27 07:39:21,714 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 07:39:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29372 states. [2019-12-27 07:39:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29372 to 29300. [2019-12-27 07:39:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29300 states. [2019-12-27 07:39:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29300 states to 29300 states and 98618 transitions. [2019-12-27 07:39:22,346 INFO L78 Accepts]: Start accepts. Automaton has 29300 states and 98618 transitions. Word has length 13 [2019-12-27 07:39:22,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:22,347 INFO L462 AbstractCegarLoop]: Abstraction has 29300 states and 98618 transitions. [2019-12-27 07:39:22,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29300 states and 98618 transitions. [2019-12-27 07:39:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:22,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:22,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:22,349 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:22,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:22,349 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-27 07:39:22,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:22,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297427268] [2019-12-27 07:39:22,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:22,414 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 07:39:22,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297427268] [2019-12-27 07:39:22,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:22,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:22,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616723890] [2019-12-27 07:39:22,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:22,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:22,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:22,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:22,416 INFO L87 Difference]: Start difference. First operand 29300 states and 98618 transitions. Second operand 3 states. [2019-12-27 07:39:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:22,630 INFO L93 Difference]: Finished difference Result 43227 states and 144586 transitions. [2019-12-27 07:39:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:22,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:39:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:22,701 INFO L225 Difference]: With dead ends: 43227 [2019-12-27 07:39:22,701 INFO L226 Difference]: Without dead ends: 43227 [2019-12-27 07:39:22,701 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 07:39:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43227 states. [2019-12-27 07:39:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43227 to 32227. [2019-12-27 07:39:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-12-27 07:39:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 107573 transitions. [2019-12-27 07:39:24,417 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 107573 transitions. Word has length 14 [2019-12-27 07:39:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:24,418 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 107573 transitions. [2019-12-27 07:39:24,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 107573 transitions. [2019-12-27 07:39:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:24,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:24,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:24,420 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:24,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-27 07:39:24,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:24,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962999124] [2019-12-27 07:39:24,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:24,490 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 07:39:24,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962999124] [2019-12-27 07:39:24,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:24,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:24,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429834838] [2019-12-27 07:39:24,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:24,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:24,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:24,493 INFO L87 Difference]: Start difference. First operand 32227 states and 107573 transitions. Second operand 4 states. [2019-12-27 07:39:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:24,858 INFO L93 Difference]: Finished difference Result 39628 states and 130327 transitions. [2019-12-27 07:39:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:24,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:39:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:24,919 INFO L225 Difference]: With dead ends: 39628 [2019-12-27 07:39:24,919 INFO L226 Difference]: Without dead ends: 39539 [2019-12-27 07:39:24,919 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 07:39:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39539 states. [2019-12-27 07:39:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39539 to 34645. [2019-12-27 07:39:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34645 states. [2019-12-27 07:39:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34645 states to 34645 states and 115289 transitions. [2019-12-27 07:39:25,511 INFO L78 Accepts]: Start accepts. Automaton has 34645 states and 115289 transitions. Word has length 14 [2019-12-27 07:39:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:25,511 INFO L462 AbstractCegarLoop]: Abstraction has 34645 states and 115289 transitions. [2019-12-27 07:39:25,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 34645 states and 115289 transitions. [2019-12-27 07:39:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:25,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:25,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:25,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:25,513 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-27 07:39:25,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:25,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810962483] [2019-12-27 07:39:25,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:25,586 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 07:39:25,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810962483] [2019-12-27 07:39:25,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:25,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:25,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734298307] [2019-12-27 07:39:25,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:25,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:25,590 INFO L87 Difference]: Start difference. First operand 34645 states and 115289 transitions. Second operand 4 states. [2019-12-27 07:39:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:25,938 INFO L93 Difference]: Finished difference Result 41557 states and 136749 transitions. [2019-12-27 07:39:25,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:25,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:39:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:27,985 INFO L225 Difference]: With dead ends: 41557 [2019-12-27 07:39:27,985 INFO L226 Difference]: Without dead ends: 41459 [2019-12-27 07:39:27,986 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 07:39:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41459 states. [2019-12-27 07:39:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41459 to 35260. [2019-12-27 07:39:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35260 states. [2019-12-27 07:39:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35260 states to 35260 states and 117020 transitions. [2019-12-27 07:39:28,589 INFO L78 Accepts]: Start accepts. Automaton has 35260 states and 117020 transitions. Word has length 14 [2019-12-27 07:39:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:28,589 INFO L462 AbstractCegarLoop]: Abstraction has 35260 states and 117020 transitions. [2019-12-27 07:39:28,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 35260 states and 117020 transitions. [2019-12-27 07:39:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:39:28,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:28,602 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 07:39:28,602 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-27 07:39:28,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:28,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358978690] [2019-12-27 07:39:28,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:28,702 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 07:39:28,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358978690] [2019-12-27 07:39:28,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:28,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:28,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972210121] [2019-12-27 07:39:28,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:28,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:28,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:28,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:28,704 INFO L87 Difference]: Start difference. First operand 35260 states and 117020 transitions. Second operand 5 states. [2019-12-27 07:39:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:29,355 INFO L93 Difference]: Finished difference Result 47518 states and 155149 transitions. [2019-12-27 07:39:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:39:29,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:39:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:29,446 INFO L225 Difference]: With dead ends: 47518 [2019-12-27 07:39:29,447 INFO L226 Difference]: Without dead ends: 47342 [2019-12-27 07:39:29,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47342 states. [2019-12-27 07:39:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47342 to 35974. [2019-12-27 07:39:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35974 states. [2019-12-27 07:39:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 119384 transitions. [2019-12-27 07:39:30,479 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 119384 transitions. Word has length 22 [2019-12-27 07:39:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:30,480 INFO L462 AbstractCegarLoop]: Abstraction has 35974 states and 119384 transitions. [2019-12-27 07:39:30,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 119384 transitions. [2019-12-27 07:39:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:39:30,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:30,492 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 07:39:30,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-27 07:39:30,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:30,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734233930] [2019-12-27 07:39:30,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:30,603 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 07:39:30,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734233930] [2019-12-27 07:39:30,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:30,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:30,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744422779] [2019-12-27 07:39:30,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:30,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:30,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:30,605 INFO L87 Difference]: Start difference. First operand 35974 states and 119384 transitions. Second operand 5 states. [2019-12-27 07:39:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:31,205 INFO L93 Difference]: Finished difference Result 47846 states and 156183 transitions. [2019-12-27 07:39:31,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:39:31,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:39:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:31,285 INFO L225 Difference]: With dead ends: 47846 [2019-12-27 07:39:31,285 INFO L226 Difference]: Without dead ends: 47578 [2019-12-27 07:39:31,286 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 07:39:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47578 states. [2019-12-27 07:39:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47578 to 33984. [2019-12-27 07:39:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33984 states. [2019-12-27 07:39:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33984 states to 33984 states and 112757 transitions. [2019-12-27 07:39:31,947 INFO L78 Accepts]: Start accepts. Automaton has 33984 states and 112757 transitions. Word has length 22 [2019-12-27 07:39:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:31,947 INFO L462 AbstractCegarLoop]: Abstraction has 33984 states and 112757 transitions. [2019-12-27 07:39:31,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 33984 states and 112757 transitions. [2019-12-27 07:39:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:39:31,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:31,961 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 07:39:31,961 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash -589690530, now seen corresponding path program 1 times [2019-12-27 07:39:31,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:31,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588800058] [2019-12-27 07:39:31,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:32,044 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 07:39:32,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588800058] [2019-12-27 07:39:32,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:32,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:39:32,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581397923] [2019-12-27 07:39:32,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:32,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:32,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:32,047 INFO L87 Difference]: Start difference. First operand 33984 states and 112757 transitions. Second operand 5 states. [2019-12-27 07:39:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:32,151 INFO L93 Difference]: Finished difference Result 15710 states and 48416 transitions. [2019-12-27 07:39:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:32,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 07:39:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:32,172 INFO L225 Difference]: With dead ends: 15710 [2019-12-27 07:39:32,172 INFO L226 Difference]: Without dead ends: 13401 [2019-12-27 07:39:32,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13401 states. [2019-12-27 07:39:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13401 to 13209. [2019-12-27 07:39:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13209 states. [2019-12-27 07:39:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13209 states to 13209 states and 40432 transitions. [2019-12-27 07:39:32,375 INFO L78 Accepts]: Start accepts. Automaton has 13209 states and 40432 transitions. Word has length 25 [2019-12-27 07:39:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:32,375 INFO L462 AbstractCegarLoop]: Abstraction has 13209 states and 40432 transitions. [2019-12-27 07:39:32,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13209 states and 40432 transitions. [2019-12-27 07:39:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:39:32,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:32,396 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 07:39:32,396 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -112163197, now seen corresponding path program 1 times [2019-12-27 07:39:32,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:32,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615732062] [2019-12-27 07:39:32,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:32,457 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 07:39:32,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615732062] [2019-12-27 07:39:32,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:32,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:32,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598251480] [2019-12-27 07:39:32,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:32,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:32,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:32,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:32,459 INFO L87 Difference]: Start difference. First operand 13209 states and 40432 transitions. Second operand 3 states. [2019-12-27 07:39:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:32,576 INFO L93 Difference]: Finished difference Result 24182 states and 73934 transitions. [2019-12-27 07:39:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:32,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:39:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:32,609 INFO L225 Difference]: With dead ends: 24182 [2019-12-27 07:39:32,609 INFO L226 Difference]: Without dead ends: 13560 [2019-12-27 07:39:32,609 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 07:39:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2019-12-27 07:39:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 13402. [2019-12-27 07:39:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2019-12-27 07:39:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 40153 transitions. [2019-12-27 07:39:33,027 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 40153 transitions. Word has length 39 [2019-12-27 07:39:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:33,027 INFO L462 AbstractCegarLoop]: Abstraction has 13402 states and 40153 transitions. [2019-12-27 07:39:33,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 40153 transitions. [2019-12-27 07:39:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:39:33,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:33,046 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 07:39:33,046 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:33,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-27 07:39:33,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:33,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110899109] [2019-12-27 07:39:33,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:33,163 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 07:39:33,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110899109] [2019-12-27 07:39:33,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:33,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:39:33,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143905069] [2019-12-27 07:39:33,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:39:33,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:39:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:39:33,166 INFO L87 Difference]: Start difference. First operand 13402 states and 40153 transitions. Second operand 6 states. [2019-12-27 07:39:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:33,278 INFO L93 Difference]: Finished difference Result 12245 states and 37182 transitions. [2019-12-27 07:39:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:39:33,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 07:39:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:33,292 INFO L225 Difference]: With dead ends: 12245 [2019-12-27 07:39:33,293 INFO L226 Difference]: Without dead ends: 10091 [2019-12-27 07:39:33,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10091 states. [2019-12-27 07:39:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10091 to 9467. [2019-12-27 07:39:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9467 states. [2019-12-27 07:39:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9467 states to 9467 states and 29555 transitions. [2019-12-27 07:39:33,432 INFO L78 Accepts]: Start accepts. Automaton has 9467 states and 29555 transitions. Word has length 40 [2019-12-27 07:39:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:33,433 INFO L462 AbstractCegarLoop]: Abstraction has 9467 states and 29555 transitions. [2019-12-27 07:39:33,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:39:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9467 states and 29555 transitions. [2019-12-27 07:39:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:33,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:33,446 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] [2019-12-27 07:39:33,447 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-27 07:39:33,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:33,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168237845] [2019-12-27 07:39:33,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:33,532 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 07:39:33,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168237845] [2019-12-27 07:39:33,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:33,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:33,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089846927] [2019-12-27 07:39:33,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:33,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:33,534 INFO L87 Difference]: Start difference. First operand 9467 states and 29555 transitions. Second operand 7 states. [2019-12-27 07:39:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:33,875 INFO L93 Difference]: Finished difference Result 25853 states and 80397 transitions. [2019-12-27 07:39:33,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:39:33,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:33,905 INFO L225 Difference]: With dead ends: 25853 [2019-12-27 07:39:33,905 INFO L226 Difference]: Without dead ends: 19749 [2019-12-27 07:39:33,905 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 07:39:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2019-12-27 07:39:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 11483. [2019-12-27 07:39:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11483 states. [2019-12-27 07:39:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 36134 transitions. [2019-12-27 07:39:34,134 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 36134 transitions. Word has length 54 [2019-12-27 07:39:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:34,134 INFO L462 AbstractCegarLoop]: Abstraction has 11483 states and 36134 transitions. [2019-12-27 07:39:34,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 36134 transitions. [2019-12-27 07:39:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:34,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:34,152 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] [2019-12-27 07:39:34,152 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-27 07:39:34,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:34,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904902850] [2019-12-27 07:39:34,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:34,242 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 07:39:34,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904902850] [2019-12-27 07:39:34,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:34,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:34,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432329177] [2019-12-27 07:39:34,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:34,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:34,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:34,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:34,244 INFO L87 Difference]: Start difference. First operand 11483 states and 36134 transitions. Second operand 7 states. [2019-12-27 07:39:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:34,663 INFO L93 Difference]: Finished difference Result 32418 states and 99744 transitions. [2019-12-27 07:39:34,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:39:34,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:34,707 INFO L225 Difference]: With dead ends: 32418 [2019-12-27 07:39:34,707 INFO L226 Difference]: Without dead ends: 22978 [2019-12-27 07:39:34,708 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 07:39:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22978 states. [2019-12-27 07:39:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22978 to 14415. [2019-12-27 07:39:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14415 states. [2019-12-27 07:39:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14415 states to 14415 states and 45368 transitions. [2019-12-27 07:39:35,002 INFO L78 Accepts]: Start accepts. Automaton has 14415 states and 45368 transitions. Word has length 54 [2019-12-27 07:39:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:35,002 INFO L462 AbstractCegarLoop]: Abstraction has 14415 states and 45368 transitions. [2019-12-27 07:39:35,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 14415 states and 45368 transitions. [2019-12-27 07:39:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:35,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:35,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:35,019 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-27 07:39:35,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:35,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109844644] [2019-12-27 07:39:35,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:35,121 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 07:39:35,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109844644] [2019-12-27 07:39:35,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:35,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:39:35,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391795098] [2019-12-27 07:39:35,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:39:35,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:39:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:39:35,123 INFO L87 Difference]: Start difference. First operand 14415 states and 45368 transitions. Second operand 8 states. [2019-12-27 07:39:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:36,161 INFO L93 Difference]: Finished difference Result 35579 states and 108354 transitions. [2019-12-27 07:39:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:39:36,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 07:39:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:36,209 INFO L225 Difference]: With dead ends: 35579 [2019-12-27 07:39:36,209 INFO L226 Difference]: Without dead ends: 33133 [2019-12-27 07:39:36,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:39:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33133 states. [2019-12-27 07:39:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33133 to 14473. [2019-12-27 07:39:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14473 states. [2019-12-27 07:39:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14473 states to 14473 states and 45640 transitions. [2019-12-27 07:39:36,555 INFO L78 Accepts]: Start accepts. Automaton has 14473 states and 45640 transitions. Word has length 54 [2019-12-27 07:39:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:36,556 INFO L462 AbstractCegarLoop]: Abstraction has 14473 states and 45640 transitions. [2019-12-27 07:39:36,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:39:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 14473 states and 45640 transitions. [2019-12-27 07:39:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:36,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:36,572 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] [2019-12-27 07:39:36,572 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1940623004, now seen corresponding path program 4 times [2019-12-27 07:39:36,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:36,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762459329] [2019-12-27 07:39:36,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:36,668 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 07:39:36,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762459329] [2019-12-27 07:39:36,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:36,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:39:36,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707296117] [2019-12-27 07:39:36,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:39:36,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:39:36,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:36,670 INFO L87 Difference]: Start difference. First operand 14473 states and 45640 transitions. Second operand 9 states. [2019-12-27 07:39:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:38,019 INFO L93 Difference]: Finished difference Result 49504 states and 150336 transitions. [2019-12-27 07:39:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 07:39:38,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:39:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:38,085 INFO L225 Difference]: With dead ends: 49504 [2019-12-27 07:39:38,085 INFO L226 Difference]: Without dead ends: 47058 [2019-12-27 07:39:38,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:39:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47058 states. [2019-12-27 07:39:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47058 to 14494. [2019-12-27 07:39:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14494 states. [2019-12-27 07:39:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 45720 transitions. [2019-12-27 07:39:38,528 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 45720 transitions. Word has length 54 [2019-12-27 07:39:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:38,529 INFO L462 AbstractCegarLoop]: Abstraction has 14494 states and 45720 transitions. [2019-12-27 07:39:38,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:39:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 45720 transitions. [2019-12-27 07:39:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:38,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:38,547 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] [2019-12-27 07:39:38,547 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:38,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1600716830, now seen corresponding path program 5 times [2019-12-27 07:39:38,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:38,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852593833] [2019-12-27 07:39:38,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:38,650 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 07:39:38,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852593833] [2019-12-27 07:39:38,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:38,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:39:38,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660657557] [2019-12-27 07:39:38,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:39:38,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:39:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:38,652 INFO L87 Difference]: Start difference. First operand 14494 states and 45720 transitions. Second operand 9 states. [2019-12-27 07:39:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:40,245 INFO L93 Difference]: Finished difference Result 63652 states and 193236 transitions. [2019-12-27 07:39:40,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 07:39:40,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:39:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:40,319 INFO L225 Difference]: With dead ends: 63652 [2019-12-27 07:39:40,319 INFO L226 Difference]: Without dead ends: 54968 [2019-12-27 07:39:40,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 07:39:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54968 states. [2019-12-27 07:39:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54968 to 18583. [2019-12-27 07:39:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18583 states. [2019-12-27 07:39:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18583 states to 18583 states and 58671 transitions. [2019-12-27 07:39:40,889 INFO L78 Accepts]: Start accepts. Automaton has 18583 states and 58671 transitions. Word has length 54 [2019-12-27 07:39:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:40,889 INFO L462 AbstractCegarLoop]: Abstraction has 18583 states and 58671 transitions. [2019-12-27 07:39:40,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:39:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 18583 states and 58671 transitions. [2019-12-27 07:39:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:40,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:40,919 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] [2019-12-27 07:39:40,919 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 6 times [2019-12-27 07:39:40,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:40,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606581294] [2019-12-27 07:39:40,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:41,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606581294] [2019-12-27 07:39:41,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:41,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:41,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076363457] [2019-12-27 07:39:41,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:41,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:41,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:41,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:41,002 INFO L87 Difference]: Start difference. First operand 18583 states and 58671 transitions. Second operand 3 states. [2019-12-27 07:39:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:41,073 INFO L93 Difference]: Finished difference Result 15959 states and 49212 transitions. [2019-12-27 07:39:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:41,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:39:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:41,095 INFO L225 Difference]: With dead ends: 15959 [2019-12-27 07:39:41,095 INFO L226 Difference]: Without dead ends: 15959 [2019-12-27 07:39:41,096 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 07:39:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15959 states. [2019-12-27 07:39:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15959 to 15403. [2019-12-27 07:39:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15403 states. [2019-12-27 07:39:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15403 states to 15403 states and 47385 transitions. [2019-12-27 07:39:41,330 INFO L78 Accepts]: Start accepts. Automaton has 15403 states and 47385 transitions. Word has length 54 [2019-12-27 07:39:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:41,330 INFO L462 AbstractCegarLoop]: Abstraction has 15403 states and 47385 transitions. [2019-12-27 07:39:41,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 15403 states and 47385 transitions. [2019-12-27 07:39:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:39:41,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:41,346 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] [2019-12-27 07:39:41,347 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1496178910, now seen corresponding path program 1 times [2019-12-27 07:39:41,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:41,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183926854] [2019-12-27 07:39:41,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:41,405 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 07:39:41,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183926854] [2019-12-27 07:39:41,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:41,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:41,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143563622] [2019-12-27 07:39:41,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:41,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:41,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:41,408 INFO L87 Difference]: Start difference. First operand 15403 states and 47385 transitions. Second operand 3 states. [2019-12-27 07:39:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:41,494 INFO L93 Difference]: Finished difference Result 15401 states and 47380 transitions. [2019-12-27 07:39:41,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:41,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:39:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:41,523 INFO L225 Difference]: With dead ends: 15401 [2019-12-27 07:39:41,523 INFO L226 Difference]: Without dead ends: 15401 [2019-12-27 07:39:41,524 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 07:39:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15401 states. [2019-12-27 07:39:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15401 to 13698. [2019-12-27 07:39:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13698 states. [2019-12-27 07:39:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13698 states to 13698 states and 42628 transitions. [2019-12-27 07:39:41,782 INFO L78 Accepts]: Start accepts. Automaton has 13698 states and 42628 transitions. Word has length 55 [2019-12-27 07:39:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:41,783 INFO L462 AbstractCegarLoop]: Abstraction has 13698 states and 42628 transitions. [2019-12-27 07:39:41,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13698 states and 42628 transitions. [2019-12-27 07:39:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:41,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:41,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:41,797 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:41,798 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-27 07:39:41,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:41,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55399530] [2019-12-27 07:39:41,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:42,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55399530] [2019-12-27 07:39:42,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:42,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:39:42,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092439552] [2019-12-27 07:39:42,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:39:42,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:42,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:39:42,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:39:42,106 INFO L87 Difference]: Start difference. First operand 13698 states and 42628 transitions. Second operand 12 states. [2019-12-27 07:39:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:44,794 INFO L93 Difference]: Finished difference Result 25752 states and 79592 transitions. [2019-12-27 07:39:44,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 07:39:44,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 07:39:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:44,839 INFO L225 Difference]: With dead ends: 25752 [2019-12-27 07:39:44,839 INFO L226 Difference]: Without dead ends: 18596 [2019-12-27 07:39:44,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2019-12-27 07:39:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18596 states. [2019-12-27 07:39:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18596 to 14432. [2019-12-27 07:39:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14432 states. [2019-12-27 07:39:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14432 states to 14432 states and 44543 transitions. [2019-12-27 07:39:45,284 INFO L78 Accepts]: Start accepts. Automaton has 14432 states and 44543 transitions. Word has length 56 [2019-12-27 07:39:45,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:45,285 INFO L462 AbstractCegarLoop]: Abstraction has 14432 states and 44543 transitions. [2019-12-27 07:39:45,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:39:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14432 states and 44543 transitions. [2019-12-27 07:39:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:45,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:45,308 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] [2019-12-27 07:39:45,309 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2011437082, now seen corresponding path program 2 times [2019-12-27 07:39:45,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:45,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223515960] [2019-12-27 07:39:45,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:45,803 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 07:39:45,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223515960] [2019-12-27 07:39:45,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:45,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:39:45,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814738031] [2019-12-27 07:39:45,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:39:45,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:45,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:39:45,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:39:45,805 INFO L87 Difference]: Start difference. First operand 14432 states and 44543 transitions. Second operand 16 states. [2019-12-27 07:39:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:48,948 INFO L93 Difference]: Finished difference Result 22101 states and 66544 transitions. [2019-12-27 07:39:48,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 07:39:48,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 07:39:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:48,978 INFO L225 Difference]: With dead ends: 22101 [2019-12-27 07:39:48,978 INFO L226 Difference]: Without dead ends: 20941 [2019-12-27 07:39:48,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=1325, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 07:39:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20941 states. [2019-12-27 07:39:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20941 to 15322. [2019-12-27 07:39:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15322 states. [2019-12-27 07:39:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15322 states to 15322 states and 47062 transitions. [2019-12-27 07:39:49,218 INFO L78 Accepts]: Start accepts. Automaton has 15322 states and 47062 transitions. Word has length 56 [2019-12-27 07:39:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:49,218 INFO L462 AbstractCegarLoop]: Abstraction has 15322 states and 47062 transitions. [2019-12-27 07:39:49,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:39:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15322 states and 47062 transitions. [2019-12-27 07:39:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:49,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:49,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] [2019-12-27 07:39:49,234 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1626383652, now seen corresponding path program 3 times [2019-12-27 07:39:49,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:49,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327022120] [2019-12-27 07:39:49,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:49,484 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 07:39:49,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327022120] [2019-12-27 07:39:49,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:49,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:39:49,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875924885] [2019-12-27 07:39:49,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:39:49,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:39:49,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:39:49,486 INFO L87 Difference]: Start difference. First operand 15322 states and 47062 transitions. Second operand 13 states. [2019-12-27 07:39:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:51,651 INFO L93 Difference]: Finished difference Result 23722 states and 71925 transitions. [2019-12-27 07:39:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:39:51,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-27 07:39:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:51,678 INFO L225 Difference]: With dead ends: 23722 [2019-12-27 07:39:51,678 INFO L226 Difference]: Without dead ends: 20379 [2019-12-27 07:39:51,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:39:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20379 states. [2019-12-27 07:39:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20379 to 15704. [2019-12-27 07:39:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15704 states. [2019-12-27 07:39:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15704 states to 15704 states and 47964 transitions. [2019-12-27 07:39:51,918 INFO L78 Accepts]: Start accepts. Automaton has 15704 states and 47964 transitions. Word has length 56 [2019-12-27 07:39:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:51,919 INFO L462 AbstractCegarLoop]: Abstraction has 15704 states and 47964 transitions. [2019-12-27 07:39:51,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:39:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15704 states and 47964 transitions. [2019-12-27 07:39:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:51,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:51,935 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] [2019-12-27 07:39:51,935 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2058222774, now seen corresponding path program 4 times [2019-12-27 07:39:51,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:51,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314896537] [2019-12-27 07:39:51,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:52,645 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 07:39:52,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314896537] [2019-12-27 07:39:52,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:52,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:39:52,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930483308] [2019-12-27 07:39:52,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:39:52,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:52,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:39:52,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:39:52,647 INFO L87 Difference]: Start difference. First operand 15704 states and 47964 transitions. Second operand 18 states. [2019-12-27 07:39:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:56,480 INFO L93 Difference]: Finished difference Result 23333 states and 70036 transitions. [2019-12-27 07:39:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 07:39:56,481 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 07:39:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:56,514 INFO L225 Difference]: With dead ends: 23333 [2019-12-27 07:39:56,514 INFO L226 Difference]: Without dead ends: 22549 [2019-12-27 07:39:56,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=368, Invalid=1612, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 07:39:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22549 states. [2019-12-27 07:39:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22549 to 15824. [2019-12-27 07:39:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15824 states. [2019-12-27 07:39:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15824 states to 15824 states and 48268 transitions. [2019-12-27 07:39:56,796 INFO L78 Accepts]: Start accepts. Automaton has 15824 states and 48268 transitions. Word has length 56 [2019-12-27 07:39:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:56,796 INFO L462 AbstractCegarLoop]: Abstraction has 15824 states and 48268 transitions. [2019-12-27 07:39:56,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:39:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 15824 states and 48268 transitions. [2019-12-27 07:39:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:56,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:56,812 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] [2019-12-27 07:39:56,813 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash 845995944, now seen corresponding path program 5 times [2019-12-27 07:39:56,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:56,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945962712] [2019-12-27 07:39:56,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:57,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945962712] [2019-12-27 07:39:57,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:57,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:39:57,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081218928] [2019-12-27 07:39:57,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:39:57,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:39:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:39:57,048 INFO L87 Difference]: Start difference. First operand 15824 states and 48268 transitions. Second operand 11 states. [2019-12-27 07:39:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:58,144 INFO L93 Difference]: Finished difference Result 28195 states and 85867 transitions. [2019-12-27 07:39:58,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 07:39:58,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 07:39:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:58,178 INFO L225 Difference]: With dead ends: 28195 [2019-12-27 07:39:58,178 INFO L226 Difference]: Without dead ends: 23201 [2019-12-27 07:39:58,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:39:58,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23201 states. [2019-12-27 07:39:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23201 to 14658. [2019-12-27 07:39:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14658 states. [2019-12-27 07:39:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14658 states to 14658 states and 45001 transitions. [2019-12-27 07:39:58,544 INFO L78 Accepts]: Start accepts. Automaton has 14658 states and 45001 transitions. Word has length 56 [2019-12-27 07:39:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:58,544 INFO L462 AbstractCegarLoop]: Abstraction has 14658 states and 45001 transitions. [2019-12-27 07:39:58,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:39:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 14658 states and 45001 transitions. [2019-12-27 07:39:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:58,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:58,559 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] [2019-12-27 07:39:58,559 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2127044956, now seen corresponding path program 6 times [2019-12-27 07:39:58,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:58,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695886510] [2019-12-27 07:39:58,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:58,675 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 07:39:58,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695886510] [2019-12-27 07:39:58,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:58,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:39:58,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377644221] [2019-12-27 07:39:58,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:39:58,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:39:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:58,679 INFO L87 Difference]: Start difference. First operand 14658 states and 45001 transitions. Second operand 9 states. [2019-12-27 07:39:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:59,583 INFO L93 Difference]: Finished difference Result 21167 states and 64457 transitions. [2019-12-27 07:39:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:39:59,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 07:39:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:59,614 INFO L225 Difference]: With dead ends: 21167 [2019-12-27 07:39:59,614 INFO L226 Difference]: Without dead ends: 20825 [2019-12-27 07:39:59,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:39:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20825 states. [2019-12-27 07:39:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20825 to 14452. [2019-12-27 07:39:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-27 07:39:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 44412 transitions. [2019-12-27 07:39:59,892 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 44412 transitions. Word has length 56 [2019-12-27 07:39:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:59,892 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 44412 transitions. [2019-12-27 07:39:59,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:39:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 44412 transitions. [2019-12-27 07:39:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:59,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:59,909 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] [2019-12-27 07:39:59,909 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 7 times [2019-12-27 07:39:59,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:59,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501716897] [2019-12-27 07:39:59,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:39:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:40:00,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:40:00,020 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:40:00,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2082~0.base_22| 4)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2082~0.base_22|) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2082~0.base_22|)) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2082~0.base_22| 1)) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2082~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2082~0.base_22|) |v_ULTIMATE.start_main_~#t2082~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff1_thd2~0_19 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= |v_ULTIMATE.start_main_~#t2082~0.offset_18| 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2084~0.base=|v_ULTIMATE.start_main_~#t2084~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_~#t2084~0.offset=|v_ULTIMATE.start_main_~#t2084~0.offset_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_~#t2083~0.offset=|v_ULTIMATE.start_main_~#t2083~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2082~0.offset=|v_ULTIMATE.start_main_~#t2082~0.offset_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2082~0.base=|v_ULTIMATE.start_main_~#t2082~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2083~0.base=|v_ULTIMATE.start_main_~#t2083~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2084~0.base, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2084~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2082~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2083~0.offset, ULTIMATE.start_main_~#t2083~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t2082~0.offset, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:40:00,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2083~0.base_10| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2083~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2083~0.base_10| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2083~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t2083~0.offset_9| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2083~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2083~0.base_10|) |v_ULTIMATE.start_main_~#t2083~0.offset_9| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2083~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2083~0.base=|v_ULTIMATE.start_main_~#t2083~0.base_10|, ULTIMATE.start_main_~#t2083~0.offset=|v_ULTIMATE.start_main_~#t2083~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2083~0.base, ULTIMATE.start_main_~#t2083~0.offset] because there is no mapped edge [2019-12-27 07:40:00,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 07:40:00,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2084~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2084~0.base_11|) (= |v_ULTIMATE.start_main_~#t2084~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2084~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2084~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2084~0.base_11|) |v_ULTIMATE.start_main_~#t2084~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2084~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2084~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2084~0.offset=|v_ULTIMATE.start_main_~#t2084~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2084~0.base=|v_ULTIMATE.start_main_~#t2084~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2084~0.offset, ULTIMATE.start_main_~#t2084~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:40:00,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1840099883 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1840099883 256)))) (or (and (= ~x$w_buff1~0_In-1840099883 |P2Thread1of1ForFork1_#t~ite32_Out-1840099883|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1840099883| ~x~0_In-1840099883)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1840099883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1840099883, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1840099883, ~x~0=~x~0_In-1840099883} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1840099883|, ~x$w_buff1~0=~x$w_buff1~0_In-1840099883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1840099883, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1840099883, ~x~0=~x~0_In-1840099883} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:40:00,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:40:00,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In364556802 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In364556802 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In364556802 |P2Thread1of1ForFork1_#t~ite34_Out364556802|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out364556802|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In364556802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In364556802} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out364556802|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In364556802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In364556802} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:40:00,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1389642197 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1389642197 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1389642197|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1389642197 |P1Thread1of1ForFork0_#t~ite28_Out1389642197|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1389642197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1389642197} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1389642197, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1389642197|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1389642197} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:40:00,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-94031038 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-94031038 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-94031038 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-94031038 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-94031038| ~x$w_buff1_used~0_In-94031038)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-94031038| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-94031038, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-94031038, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-94031038, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-94031038} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-94031038, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-94031038, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-94031038, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-94031038|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-94031038} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:40:00,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In527748843 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In527748843 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out527748843 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out527748843 ~x$r_buff0_thd2~0_In527748843)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527748843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527748843} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out527748843|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out527748843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527748843} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:40:00,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In403002981 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In403002981 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In403002981 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In403002981 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In403002981 |P1Thread1of1ForFork0_#t~ite31_Out403002981|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out403002981|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In403002981, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In403002981, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In403002981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In403002981} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out403002981|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In403002981, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In403002981, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In403002981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In403002981} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:40:00,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:40:00,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2019087174 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-2019087174| |P0Thread1of1ForFork2_#t~ite9_Out-2019087174|) (= |P0Thread1of1ForFork2_#t~ite8_Out-2019087174| ~x$w_buff0~0_In-2019087174) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2019087174 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-2019087174 256))) (= (mod ~x$w_buff0_used~0_In-2019087174 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2019087174 256)))))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite9_Out-2019087174| ~x$w_buff0~0_In-2019087174) (= |P0Thread1of1ForFork2_#t~ite8_In-2019087174| |P0Thread1of1ForFork2_#t~ite8_Out-2019087174|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2019087174, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2019087174, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-2019087174|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2019087174, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2019087174, ~weak$$choice2~0=~weak$$choice2~0_In-2019087174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2019087174} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-2019087174, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2019087174, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-2019087174|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2019087174, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-2019087174|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2019087174, ~weak$$choice2~0=~weak$$choice2~0_In-2019087174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2019087174} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 07:40:00,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1126285589 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1126285589 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1126285589 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1126285589 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1126285589 |P2Thread1of1ForFork1_#t~ite35_Out1126285589|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out1126285589| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1126285589, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1126285589, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1126285589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1126285589} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1126285589|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1126285589, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1126285589, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1126285589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1126285589} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:40:00,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1705385086 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1705385086 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1705385086| ~x$r_buff0_thd3~0_In1705385086)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1705385086| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1705385086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1705385086} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1705385086|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1705385086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1705385086} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:40:00,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1721603077 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1721603077 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1721603077 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1721603077 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1721603077| ~x$r_buff1_thd3~0_In1721603077) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1721603077|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1721603077, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1721603077, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1721603077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1721603077} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1721603077|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1721603077, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1721603077, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1721603077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1721603077} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:40:00,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 07:40:00,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1482898582 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out1482898582| ~x$w_buff1_used~0_In1482898582) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1482898582| |P0Thread1of1ForFork2_#t~ite17_Out1482898582|)) (and .cse0 (= ~x$w_buff1_used~0_In1482898582 |P0Thread1of1ForFork2_#t~ite17_Out1482898582|) (= |P0Thread1of1ForFork2_#t~ite18_Out1482898582| |P0Thread1of1ForFork2_#t~ite17_Out1482898582|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1482898582 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1482898582 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In1482898582 256) 0)) (and (= (mod ~x$r_buff1_thd1~0_In1482898582 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1482898582, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1482898582|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1482898582, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1482898582, ~weak$$choice2~0=~weak$$choice2~0_In1482898582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1482898582} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1482898582, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1482898582|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1482898582|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1482898582, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1482898582, ~weak$$choice2~0=~weak$$choice2~0_In1482898582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1482898582} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:40:00,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 07:40:00,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In2126503872 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In2126503872 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In2126503872 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In2126503872 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In2126503872 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out2126503872| |P0Thread1of1ForFork2_#t~ite23_Out2126503872|))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (or .cse1 (not .cse3)) .cse4 .cse5 (= |P0Thread1of1ForFork2_#t~ite22_Out2126503872| |P0Thread1of1ForFork2_#t~ite23_Out2126503872|) (= |P0Thread1of1ForFork2_#t~ite22_Out2126503872| 0))) (and (or (and (not .cse4) (= |P0Thread1of1ForFork2_#t~ite24_Out2126503872| ~x$r_buff1_thd1~0_In2126503872) (= |P0Thread1of1ForFork2_#t~ite23_Out2126503872| |P0Thread1of1ForFork2_#t~ite23_In2126503872|)) (and (or .cse2 (and .cse6 .cse0) (and .cse6 .cse3)) (= ~x$r_buff1_thd1~0_In2126503872 |P0Thread1of1ForFork2_#t~ite23_Out2126503872|) .cse4 .cse5)) (= |P0Thread1of1ForFork2_#t~ite22_In2126503872| |P0Thread1of1ForFork2_#t~ite22_Out2126503872|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2126503872, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2126503872, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2126503872, ~weak$$choice2~0=~weak$$choice2~0_In2126503872, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In2126503872|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In2126503872|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126503872} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2126503872, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2126503872, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2126503872, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out2126503872|, ~weak$$choice2~0=~weak$$choice2~0_In2126503872, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out2126503872|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out2126503872|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126503872} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 07:40:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:40:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:40:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In827307538 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In827307538 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In827307538 |ULTIMATE.start_main_#t~ite41_Out827307538|)) (and (= |ULTIMATE.start_main_#t~ite41_Out827307538| ~x$w_buff1~0_In827307538) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In827307538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In827307538, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In827307538, ~x~0=~x~0_In827307538} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out827307538|, ~x$w_buff1~0=~x$w_buff1~0_In827307538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In827307538, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In827307538, ~x~0=~x~0_In827307538} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 07:40:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 07:40:00,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1269905541 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1269905541 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1269905541| ~x$w_buff0_used~0_In1269905541) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1269905541|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1269905541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269905541} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1269905541, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1269905541|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1269905541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:40:00,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-258465950 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-258465950 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-258465950 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-258465950 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-258465950 |ULTIMATE.start_main_#t~ite44_Out-258465950|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-258465950|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-258465950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-258465950, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-258465950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-258465950} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-258465950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-258465950, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-258465950, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-258465950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-258465950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:40:00,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-748181194 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-748181194 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-748181194| ~x$r_buff0_thd0~0_In-748181194)) (and (= |ULTIMATE.start_main_#t~ite45_Out-748181194| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-748181194, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-748181194} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-748181194, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-748181194|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-748181194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:40:00,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In642979262 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In642979262 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In642979262 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In642979262 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out642979262| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In642979262 |ULTIMATE.start_main_#t~ite46_Out642979262|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In642979262, ~x$w_buff1_used~0=~x$w_buff1_used~0_In642979262, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In642979262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642979262} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In642979262, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out642979262|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In642979262, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In642979262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642979262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:40:00,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:40:00,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:40:00 BasicIcfg [2019-12-27 07:40:00,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:40:00,139 INFO L168 Benchmark]: Toolchain (without parser) took 86989.53 ms. Allocated memory was 138.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:40:00,140 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:40:00,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.45 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 158.1 MB in the end (delta: -56.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:00,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.15 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:00,142 INFO L168 Benchmark]: Boogie Preprocessor took 40.04 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:00,142 INFO L168 Benchmark]: RCFGBuilder took 879.21 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 106.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:00,143 INFO L168 Benchmark]: TraceAbstraction took 85291.20 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 106.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 975.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:00,149 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.15 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 710.45 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 158.1 MB in the end (delta: -56.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.15 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.04 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.21 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 106.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85291.20 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 106.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 975.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2082, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2083, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2084, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 33.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5346 SDtfs, 8526 SDslu, 18887 SDs, 0 SdLazy, 13725 SolverSat, 464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116665occurred 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: 29.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 204172 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 912 ConstructedInterpolants, 0 QuantifiedInterpolants, 216430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...