/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/safe002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:22:20,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:22:20,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:22:20,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:22:20,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:22:20,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:22:20,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:22:20,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:22:20,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:22:20,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:22:20,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:22:20,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:22:20,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:22:20,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:22:20,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:22:20,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:22:20,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:22:20,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:22:20,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:22:20,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:22:20,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:22:20,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:22:20,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:22:20,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:22:20,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:22:20,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:22:20,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:22:20,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:22:20,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:22:20,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:22:20,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:22:20,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:22:20,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:22:20,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:22:20,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:22:20,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:22:20,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:22:20,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:22:20,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:22:20,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:22:20,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:22:20,906 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:22:20,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:22:20,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:22:20,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:22:20,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:22:20,922 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:22:20,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:22:20,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:22:20,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:22:20,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:22:20,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:22:20,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:22:20,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:22:20,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:22:20,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:22:20,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:22:20,924 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:22:20,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:22:20,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:22:20,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:22:20,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:22:20,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:22:20,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:22:20,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:22:20,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:22:20,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:22:20,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:22:20,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:22:20,926 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:22:20,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:22:20,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:22:21,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:22:21,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:22:21,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:22:21,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:22:21,216 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:22:21,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-27 07:22:21,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe1906d9/3ec7af87158f426d9234335efc22de5d/FLAG958944f6d [2019-12-27 07:22:21,905 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:22:21,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-27 07:22:21,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe1906d9/3ec7af87158f426d9234335efc22de5d/FLAG958944f6d [2019-12-27 07:22:22,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe1906d9/3ec7af87158f426d9234335efc22de5d [2019-12-27 07:22:22,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:22:22,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:22:22,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:22:22,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:22:22,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:22:22,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:22,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec30c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22, skipping insertion in model container [2019-12-27 07:22:22,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:22,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:22:22,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:22:22,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:22:22,838 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:22:22,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:22:22,984 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:22:22,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22 WrapperNode [2019-12-27 07:22:22,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:22:22,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:22:22,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:22:22,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:22:22,995 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:22:22" (1/1) ... [2019-12-27 07:22:23,020 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:22:22" (1/1) ... [2019-12-27 07:22:23,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:22:23,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:22:23,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:22:23,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:22:23,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:23,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:23,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:23,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:23,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:23,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:23,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (1/1) ... [2019-12-27 07:22:23,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:22:23,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:22:23,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:22:23,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:22:23,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (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:22:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:22:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:22:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:22:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:22:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:22:23,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:22:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:22:23,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:22:23,191 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:22:23,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:22:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:22:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:22:23,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:22:23,194 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:22:23,893 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:22:23,894 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:22:23,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:22:23 BoogieIcfgContainer [2019-12-27 07:22:23,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:22:23,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:22:23,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:22:23,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:22:23,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:22:22" (1/3) ... [2019-12-27 07:22:23,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76940973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:22:23, skipping insertion in model container [2019-12-27 07:22:23,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:22:22" (2/3) ... [2019-12-27 07:22:23,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76940973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:22:23, skipping insertion in model container [2019-12-27 07:22:23,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:22:23" (3/3) ... [2019-12-27 07:22:23,904 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2019-12-27 07:22:23,915 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:22:23,915 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:22:23,924 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:22:23,925 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:22:23,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,968 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,969 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:23,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,021 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,022 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,040 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:22:24,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:22:24,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:22:24,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:22:24,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:22:24,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:22:24,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:22:24,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:22:24,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:22:24,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:22:24,116 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 07:22:24,118 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:22:24,271 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:22:24,271 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:22:24,288 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 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:22:24,310 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:22:24,360 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:22:24,360 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:22:24,368 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 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:22:24,390 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:22:24,392 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:22:28,277 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:22:28,418 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:22:28,445 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75395 [2019-12-27 07:22:28,445 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 07:22:28,449 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 07:22:41,335 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89162 states. [2019-12-27 07:22:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 89162 states. [2019-12-27 07:22:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:22:41,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:41,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:22:41,345 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:22:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash 795562218, now seen corresponding path program 1 times [2019-12-27 07:22:41,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:41,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993621934] [2019-12-27 07:22:41,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:41,606 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:22:41,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993621934] [2019-12-27 07:22:41,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:41,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:22:41,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046644194] [2019-12-27 07:22:41,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:41,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:41,637 INFO L87 Difference]: Start difference. First operand 89162 states. Second operand 3 states. [2019-12-27 07:22:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:44,133 INFO L93 Difference]: Finished difference Result 87552 states and 377777 transitions. [2019-12-27 07:22:44,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:44,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:22:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:44,720 INFO L225 Difference]: With dead ends: 87552 [2019-12-27 07:22:44,720 INFO L226 Difference]: Without dead ends: 82092 [2019-12-27 07:22:44,722 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:22:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82092 states. [2019-12-27 07:22:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82092 to 82092. [2019-12-27 07:22:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82092 states. [2019-12-27 07:22:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82092 states to 82092 states and 353697 transitions. [2019-12-27 07:22:55,152 INFO L78 Accepts]: Start accepts. Automaton has 82092 states and 353697 transitions. Word has length 5 [2019-12-27 07:22:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:55,153 INFO L462 AbstractCegarLoop]: Abstraction has 82092 states and 353697 transitions. [2019-12-27 07:22:55,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 82092 states and 353697 transitions. [2019-12-27 07:22:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:22:55,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:55,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:55,163 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:22:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1486977711, now seen corresponding path program 1 times [2019-12-27 07:22:55,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:55,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134890085] [2019-12-27 07:22:55,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:55,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:22:55,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134890085] [2019-12-27 07:22:55,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:55,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:22:55,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334336099] [2019-12-27 07:22:55,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:22:55,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:22:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:22:55,246 INFO L87 Difference]: Start difference. First operand 82092 states and 353697 transitions. Second operand 3 states. [2019-12-27 07:22:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:55,479 INFO L93 Difference]: Finished difference Result 21487 states and 74397 transitions. [2019-12-27 07:22:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:22:55,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:22:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:55,546 INFO L225 Difference]: With dead ends: 21487 [2019-12-27 07:22:55,546 INFO L226 Difference]: Without dead ends: 21487 [2019-12-27 07:22:55,547 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:22:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2019-12-27 07:22:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 21487. [2019-12-27 07:22:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-12-27 07:22:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 74397 transitions. [2019-12-27 07:22:56,166 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 74397 transitions. Word has length 13 [2019-12-27 07:22:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:56,167 INFO L462 AbstractCegarLoop]: Abstraction has 21487 states and 74397 transitions. [2019-12-27 07:22:56,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:22:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 74397 transitions. [2019-12-27 07:22:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:22:56,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:56,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:56,170 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:22:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:56,170 INFO L82 PathProgramCache]: Analyzing trace with hash -726251993, now seen corresponding path program 1 times [2019-12-27 07:22:56,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:56,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111264765] [2019-12-27 07:22:56,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:56,255 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:22:56,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111264765] [2019-12-27 07:22:56,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:56,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:22:56,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111462254] [2019-12-27 07:22:56,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:22:56,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:22:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:22:56,258 INFO L87 Difference]: Start difference. First operand 21487 states and 74397 transitions. Second operand 4 states. [2019-12-27 07:22:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:57,317 INFO L93 Difference]: Finished difference Result 31642 states and 105483 transitions. [2019-12-27 07:22:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:22:57,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:22:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:22:57,407 INFO L225 Difference]: With dead ends: 31642 [2019-12-27 07:22:57,407 INFO L226 Difference]: Without dead ends: 31628 [2019-12-27 07:22:57,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:22:57,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31628 states. [2019-12-27 07:22:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31628 to 28614. [2019-12-27 07:22:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28614 states. [2019-12-27 07:22:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28614 states to 28614 states and 96383 transitions. [2019-12-27 07:22:58,252 INFO L78 Accepts]: Start accepts. Automaton has 28614 states and 96383 transitions. Word has length 13 [2019-12-27 07:22:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:22:58,253 INFO L462 AbstractCegarLoop]: Abstraction has 28614 states and 96383 transitions. [2019-12-27 07:22:58,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:22:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 28614 states and 96383 transitions. [2019-12-27 07:22:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:22:58,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:22:58,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:22:58,256 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:22:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:22:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1448024626, now seen corresponding path program 1 times [2019-12-27 07:22:58,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:22:58,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144586716] [2019-12-27 07:22:58,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:22:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:22:58,369 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:22:58,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144586716] [2019-12-27 07:22:58,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:22:58,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:22:58,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177601301] [2019-12-27 07:22:58,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:22:58,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:22:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:22:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:22:58,371 INFO L87 Difference]: Start difference. First operand 28614 states and 96383 transitions. Second operand 5 states. [2019-12-27 07:22:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:22:58,885 INFO L93 Difference]: Finished difference Result 41448 states and 137006 transitions. [2019-12-27 07:22:58,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:22:58,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 07:22:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:00,826 INFO L225 Difference]: With dead ends: 41448 [2019-12-27 07:23:00,826 INFO L226 Difference]: Without dead ends: 41430 [2019-12-27 07:23:00,827 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:23:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41430 states. [2019-12-27 07:23:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41430 to 32619. [2019-12-27 07:23:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32619 states. [2019-12-27 07:23:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32619 states to 32619 states and 109205 transitions. [2019-12-27 07:23:01,888 INFO L78 Accepts]: Start accepts. Automaton has 32619 states and 109205 transitions. Word has length 14 [2019-12-27 07:23:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:01,889 INFO L462 AbstractCegarLoop]: Abstraction has 32619 states and 109205 transitions. [2019-12-27 07:23:01,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:23:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32619 states and 109205 transitions. [2019-12-27 07:23:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:23:01,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:01,901 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:23:01,901 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:23:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash -84735485, now seen corresponding path program 1 times [2019-12-27 07:23:01,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:01,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101333424] [2019-12-27 07:23:01,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:23:02,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101333424] [2019-12-27 07:23:02,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:02,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:23:02,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112793945] [2019-12-27 07:23:02,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:23:02,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:23:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:23:02,115 INFO L87 Difference]: Start difference. First operand 32619 states and 109205 transitions. Second operand 6 states. [2019-12-27 07:23:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:02,931 INFO L93 Difference]: Finished difference Result 56365 states and 183236 transitions. [2019-12-27 07:23:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:23:02,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:23:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:03,085 INFO L225 Difference]: With dead ends: 56365 [2019-12-27 07:23:03,085 INFO L226 Difference]: Without dead ends: 56335 [2019-12-27 07:23:03,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:23:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56335 states. [2019-12-27 07:23:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56335 to 37720. [2019-12-27 07:23:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37720 states. [2019-12-27 07:23:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37720 states to 37720 states and 124779 transitions. [2019-12-27 07:23:04,358 INFO L78 Accepts]: Start accepts. Automaton has 37720 states and 124779 transitions. Word has length 22 [2019-12-27 07:23:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:04,358 INFO L462 AbstractCegarLoop]: Abstraction has 37720 states and 124779 transitions. [2019-12-27 07:23:04,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:23:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 37720 states and 124779 transitions. [2019-12-27 07:23:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:23:04,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:04,371 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:23:04,371 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:23:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1487058349, now seen corresponding path program 2 times [2019-12-27 07:23:04,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:04,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658790822] [2019-12-27 07:23:04,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:04,487 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:23:04,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658790822] [2019-12-27 07:23:04,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:04,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:23:04,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543188848] [2019-12-27 07:23:04,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:23:04,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:23:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:23:04,490 INFO L87 Difference]: Start difference. First operand 37720 states and 124779 transitions. Second operand 7 states. [2019-12-27 07:23:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:05,792 INFO L93 Difference]: Finished difference Result 56547 states and 183575 transitions. [2019-12-27 07:23:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:23:05,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 07:23:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:05,937 INFO L225 Difference]: With dead ends: 56547 [2019-12-27 07:23:05,938 INFO L226 Difference]: Without dead ends: 56505 [2019-12-27 07:23:05,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:23:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56505 states. [2019-12-27 07:23:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56505 to 32874. [2019-12-27 07:23:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32874 states. [2019-12-27 07:23:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32874 states to 32874 states and 109363 transitions. [2019-12-27 07:23:06,850 INFO L78 Accepts]: Start accepts. Automaton has 32874 states and 109363 transitions. Word has length 22 [2019-12-27 07:23:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:06,850 INFO L462 AbstractCegarLoop]: Abstraction has 32874 states and 109363 transitions. [2019-12-27 07:23:06,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:23:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 32874 states and 109363 transitions. [2019-12-27 07:23:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:23:06,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:06,867 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:23:06,867 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:23:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1211743988, now seen corresponding path program 1 times [2019-12-27 07:23:06,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:06,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619578902] [2019-12-27 07:23:06,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:06,922 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:23:06,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619578902] [2019-12-27 07:23:06,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:06,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:23:06,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857457707] [2019-12-27 07:23:06,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:23:06,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:06,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:23:06,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:23:06,924 INFO L87 Difference]: Start difference. First operand 32874 states and 109363 transitions. Second operand 4 states. [2019-12-27 07:23:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:06,991 INFO L93 Difference]: Finished difference Result 12715 states and 39293 transitions. [2019-12-27 07:23:06,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:23:06,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:23:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:07,016 INFO L225 Difference]: With dead ends: 12715 [2019-12-27 07:23:07,016 INFO L226 Difference]: Without dead ends: 12715 [2019-12-27 07:23:07,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:23:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2019-12-27 07:23:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 12619. [2019-12-27 07:23:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12619 states. [2019-12-27 07:23:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12619 states to 12619 states and 39013 transitions. [2019-12-27 07:23:07,234 INFO L78 Accepts]: Start accepts. Automaton has 12619 states and 39013 transitions. Word has length 25 [2019-12-27 07:23:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:07,235 INFO L462 AbstractCegarLoop]: Abstraction has 12619 states and 39013 transitions. [2019-12-27 07:23:07,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:23:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 12619 states and 39013 transitions. [2019-12-27 07:23:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:23:07,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:07,254 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:23:07,254 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:23:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash 261453908, now seen corresponding path program 1 times [2019-12-27 07:23:07,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:07,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049416919] [2019-12-27 07:23:07,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:07,322 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:23:07,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049416919] [2019-12-27 07:23:07,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:07,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:23:07,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987428344] [2019-12-27 07:23:07,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:23:07,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:23:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:23:07,325 INFO L87 Difference]: Start difference. First operand 12619 states and 39013 transitions. Second operand 3 states. [2019-12-27 07:23:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:07,381 INFO L93 Difference]: Finished difference Result 12618 states and 39011 transitions. [2019-12-27 07:23:07,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:23:07,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:23:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:07,405 INFO L225 Difference]: With dead ends: 12618 [2019-12-27 07:23:07,405 INFO L226 Difference]: Without dead ends: 12618 [2019-12-27 07:23:07,405 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:23:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2019-12-27 07:23:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 12618. [2019-12-27 07:23:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12618 states. [2019-12-27 07:23:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 39011 transitions. [2019-12-27 07:23:07,768 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 39011 transitions. Word has length 39 [2019-12-27 07:23:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:07,769 INFO L462 AbstractCegarLoop]: Abstraction has 12618 states and 39011 transitions. [2019-12-27 07:23:07,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:23:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 39011 transitions. [2019-12-27 07:23:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:23:07,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:07,788 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:23:07,789 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:23:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1879938010, now seen corresponding path program 1 times [2019-12-27 07:23:07,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:07,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125688503] [2019-12-27 07:23:07,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:23:07,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125688503] [2019-12-27 07:23:07,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:07,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:23:07,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480263594] [2019-12-27 07:23:07,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:23:07,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:23:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:23:07,868 INFO L87 Difference]: Start difference. First operand 12618 states and 39011 transitions. Second operand 5 states. [2019-12-27 07:23:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:07,943 INFO L93 Difference]: Finished difference Result 11359 states and 35772 transitions. [2019-12-27 07:23:07,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:23:07,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:23:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:07,961 INFO L225 Difference]: With dead ends: 11359 [2019-12-27 07:23:07,961 INFO L226 Difference]: Without dead ends: 11359 [2019-12-27 07:23:07,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:23:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11359 states. [2019-12-27 07:23:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11359 to 11019. [2019-12-27 07:23:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11019 states. [2019-12-27 07:23:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11019 states to 11019 states and 34816 transitions. [2019-12-27 07:23:08,140 INFO L78 Accepts]: Start accepts. Automaton has 11019 states and 34816 transitions. Word has length 40 [2019-12-27 07:23:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:08,141 INFO L462 AbstractCegarLoop]: Abstraction has 11019 states and 34816 transitions. [2019-12-27 07:23:08,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:23:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 11019 states and 34816 transitions. [2019-12-27 07:23:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:08,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:08,157 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:23:08,157 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:23:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1466334831, now seen corresponding path program 1 times [2019-12-27 07:23:08,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:08,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657472159] [2019-12-27 07:23:08,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:23:08,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657472159] [2019-12-27 07:23:08,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:08,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:23:08,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123604272] [2019-12-27 07:23:08,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:23:08,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:23:08,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:23:08,225 INFO L87 Difference]: Start difference. First operand 11019 states and 34816 transitions. Second operand 3 states. [2019-12-27 07:23:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:08,312 INFO L93 Difference]: Finished difference Result 14923 states and 47277 transitions. [2019-12-27 07:23:08,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:23:08,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:23:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:08,334 INFO L225 Difference]: With dead ends: 14923 [2019-12-27 07:23:08,334 INFO L226 Difference]: Without dead ends: 14923 [2019-12-27 07:23:08,335 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:23:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2019-12-27 07:23:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 12415. [2019-12-27 07:23:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12415 states. [2019-12-27 07:23:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12415 states to 12415 states and 39778 transitions. [2019-12-27 07:23:08,558 INFO L78 Accepts]: Start accepts. Automaton has 12415 states and 39778 transitions. Word has length 54 [2019-12-27 07:23:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:08,558 INFO L462 AbstractCegarLoop]: Abstraction has 12415 states and 39778 transitions. [2019-12-27 07:23:08,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:23:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12415 states and 39778 transitions. [2019-12-27 07:23:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:08,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:08,580 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:23:08,580 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:23:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash 81383116, now seen corresponding path program 1 times [2019-12-27 07:23:08,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:08,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512848195] [2019-12-27 07:23:08,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:08,663 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:23:08,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512848195] [2019-12-27 07:23:08,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:08,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:23:08,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583926426] [2019-12-27 07:23:08,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:23:08,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:23:08,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:23:08,666 INFO L87 Difference]: Start difference. First operand 12415 states and 39778 transitions. Second operand 4 states. [2019-12-27 07:23:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:08,786 INFO L93 Difference]: Finished difference Result 23746 states and 76295 transitions. [2019-12-27 07:23:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:23:08,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 07:23:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:08,819 INFO L225 Difference]: With dead ends: 23746 [2019-12-27 07:23:08,819 INFO L226 Difference]: Without dead ends: 11640 [2019-12-27 07:23:08,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:23:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11640 states. [2019-12-27 07:23:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11640 to 11640. [2019-12-27 07:23:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11640 states. [2019-12-27 07:23:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11640 states to 11640 states and 37407 transitions. [2019-12-27 07:23:09,159 INFO L78 Accepts]: Start accepts. Automaton has 11640 states and 37407 transitions. Word has length 54 [2019-12-27 07:23:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:09,159 INFO L462 AbstractCegarLoop]: Abstraction has 11640 states and 37407 transitions. [2019-12-27 07:23:09,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:23:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 11640 states and 37407 transitions. [2019-12-27 07:23:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:09,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:09,185 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:23:09,185 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:23:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash -886395566, now seen corresponding path program 2 times [2019-12-27 07:23:09,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:09,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902109620] [2019-12-27 07:23:09,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:09,297 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:23:09,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902109620] [2019-12-27 07:23:09,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:09,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:23:09,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064307355] [2019-12-27 07:23:09,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:23:09,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:23:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:23:09,299 INFO L87 Difference]: Start difference. First operand 11640 states and 37407 transitions. Second operand 4 states. [2019-12-27 07:23:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:09,567 INFO L93 Difference]: Finished difference Result 29764 states and 97472 transitions. [2019-12-27 07:23:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:23:09,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 07:23:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:09,578 INFO L225 Difference]: With dead ends: 29764 [2019-12-27 07:23:09,578 INFO L226 Difference]: Without dead ends: 5215 [2019-12-27 07:23:09,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:23:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-12-27 07:23:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5215. [2019-12-27 07:23:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-12-27 07:23:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 17564 transitions. [2019-12-27 07:23:09,731 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 17564 transitions. Word has length 54 [2019-12-27 07:23:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:09,732 INFO L462 AbstractCegarLoop]: Abstraction has 5215 states and 17564 transitions. [2019-12-27 07:23:09,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:23:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 17564 transitions. [2019-12-27 07:23:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:09,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:09,743 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:23:09,743 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:23:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 139987658, now seen corresponding path program 3 times [2019-12-27 07:23:09,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:09,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227176401] [2019-12-27 07:23:09,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:09,902 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:23:09,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227176401] [2019-12-27 07:23:09,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:09,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:23:09,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466883406] [2019-12-27 07:23:09,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:23:09,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:23:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:23:09,904 INFO L87 Difference]: Start difference. First operand 5215 states and 17564 transitions. Second operand 7 states. [2019-12-27 07:23:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:10,171 INFO L93 Difference]: Finished difference Result 9815 states and 32405 transitions. [2019-12-27 07:23:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:23:10,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:23:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:10,188 INFO L225 Difference]: With dead ends: 9815 [2019-12-27 07:23:10,188 INFO L226 Difference]: Without dead ends: 7165 [2019-12-27 07:23:10,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:23:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2019-12-27 07:23:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 6422. [2019-12-27 07:23:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6422 states. [2019-12-27 07:23:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 21551 transitions. [2019-12-27 07:23:10,400 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 21551 transitions. Word has length 54 [2019-12-27 07:23:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:10,401 INFO L462 AbstractCegarLoop]: Abstraction has 6422 states and 21551 transitions. [2019-12-27 07:23:10,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:23:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 21551 transitions. [2019-12-27 07:23:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:10,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:10,413 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:23:10,413 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:23:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1645888394, now seen corresponding path program 4 times [2019-12-27 07:23:10,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:10,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074196520] [2019-12-27 07:23:10,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:10,539 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:23:10,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074196520] [2019-12-27 07:23:10,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:10,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:23:10,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290123542] [2019-12-27 07:23:10,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:23:10,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:23:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:23:10,542 INFO L87 Difference]: Start difference. First operand 6422 states and 21551 transitions. Second operand 7 states. [2019-12-27 07:23:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:10,792 INFO L93 Difference]: Finished difference Result 11902 states and 38980 transitions. [2019-12-27 07:23:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:23:10,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:23:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:10,807 INFO L225 Difference]: With dead ends: 11902 [2019-12-27 07:23:10,808 INFO L226 Difference]: Without dead ends: 8756 [2019-12-27 07:23:10,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:23:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8756 states. [2019-12-27 07:23:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8756 to 7826. [2019-12-27 07:23:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7826 states. [2019-12-27 07:23:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7826 states to 7826 states and 26019 transitions. [2019-12-27 07:23:10,949 INFO L78 Accepts]: Start accepts. Automaton has 7826 states and 26019 transitions. Word has length 54 [2019-12-27 07:23:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:10,949 INFO L462 AbstractCegarLoop]: Abstraction has 7826 states and 26019 transitions. [2019-12-27 07:23:10,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:23:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7826 states and 26019 transitions. [2019-12-27 07:23:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:10,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:10,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:23:10,959 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:23:10,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1656812138, now seen corresponding path program 5 times [2019-12-27 07:23:10,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:10,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986187630] [2019-12-27 07:23:10,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:11,049 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:23:11,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986187630] [2019-12-27 07:23:11,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:11,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:23:11,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744990768] [2019-12-27 07:23:11,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:23:11,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:23:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:23:11,051 INFO L87 Difference]: Start difference. First operand 7826 states and 26019 transitions. Second operand 7 states. [2019-12-27 07:23:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:11,352 INFO L93 Difference]: Finished difference Result 17215 states and 55787 transitions. [2019-12-27 07:23:11,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:23:11,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:23:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:11,381 INFO L225 Difference]: With dead ends: 17215 [2019-12-27 07:23:11,381 INFO L226 Difference]: Without dead ends: 14695 [2019-12-27 07:23:11,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:23:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14695 states. [2019-12-27 07:23:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14695 to 7986. [2019-12-27 07:23:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7986 states. [2019-12-27 07:23:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7986 states to 7986 states and 26559 transitions. [2019-12-27 07:23:11,563 INFO L78 Accepts]: Start accepts. Automaton has 7986 states and 26559 transitions. Word has length 54 [2019-12-27 07:23:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:11,563 INFO L462 AbstractCegarLoop]: Abstraction has 7986 states and 26559 transitions. [2019-12-27 07:23:11,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:23:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 7986 states and 26559 transitions. [2019-12-27 07:23:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:11,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:11,573 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:23:11,573 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:23:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash -434377068, now seen corresponding path program 6 times [2019-12-27 07:23:11,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:11,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121686499] [2019-12-27 07:23:11,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:23:11,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121686499] [2019-12-27 07:23:11,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:11,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:23:11,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135037112] [2019-12-27 07:23:11,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:23:11,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:23:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:23:11,701 INFO L87 Difference]: Start difference. First operand 7986 states and 26559 transitions. Second operand 8 states. [2019-12-27 07:23:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:12,831 INFO L93 Difference]: Finished difference Result 20061 states and 62674 transitions. [2019-12-27 07:23:12,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:23:12,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 07:23:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:12,860 INFO L225 Difference]: With dead ends: 20061 [2019-12-27 07:23:12,860 INFO L226 Difference]: Without dead ends: 19977 [2019-12-27 07:23:12,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:23:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19977 states. [2019-12-27 07:23:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19977 to 13288. [2019-12-27 07:23:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13288 states. [2019-12-27 07:23:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13288 states to 13288 states and 41695 transitions. [2019-12-27 07:23:13,142 INFO L78 Accepts]: Start accepts. Automaton has 13288 states and 41695 transitions. Word has length 54 [2019-12-27 07:23:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:13,142 INFO L462 AbstractCegarLoop]: Abstraction has 13288 states and 41695 transitions. [2019-12-27 07:23:13,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:23:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 13288 states and 41695 transitions. [2019-12-27 07:23:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:13,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:13,165 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:23:13,165 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:23:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash -458785952, now seen corresponding path program 7 times [2019-12-27 07:23:13,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:13,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724982223] [2019-12-27 07:23:13,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:13,269 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:23:13,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724982223] [2019-12-27 07:23:13,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:13,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:23:13,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445909465] [2019-12-27 07:23:13,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:23:13,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:13,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:23:13,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:23:13,272 INFO L87 Difference]: Start difference. First operand 13288 states and 41695 transitions. Second operand 7 states. [2019-12-27 07:23:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:14,002 INFO L93 Difference]: Finished difference Result 21346 states and 65008 transitions. [2019-12-27 07:23:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:23:14,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:23:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:14,032 INFO L225 Difference]: With dead ends: 21346 [2019-12-27 07:23:14,032 INFO L226 Difference]: Without dead ends: 21236 [2019-12-27 07:23:14,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:23:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-27 07:23:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 17446. [2019-12-27 07:23:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17446 states. [2019-12-27 07:23:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 54229 transitions. [2019-12-27 07:23:14,347 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 54229 transitions. Word has length 54 [2019-12-27 07:23:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:14,348 INFO L462 AbstractCegarLoop]: Abstraction has 17446 states and 54229 transitions. [2019-12-27 07:23:14,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:23:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 54229 transitions. [2019-12-27 07:23:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:23:14,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:14,377 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:23:14,377 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:23:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2051129792, now seen corresponding path program 8 times [2019-12-27 07:23:14,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:14,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34115709] [2019-12-27 07:23:14,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:14,428 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:23:14,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34115709] [2019-12-27 07:23:14,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:14,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:23:14,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261590453] [2019-12-27 07:23:14,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:23:14,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:23:14,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:23:14,430 INFO L87 Difference]: Start difference. First operand 17446 states and 54229 transitions. Second operand 3 states. [2019-12-27 07:23:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:14,485 INFO L93 Difference]: Finished difference Result 11033 states and 34214 transitions. [2019-12-27 07:23:14,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:23:14,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:23:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:14,502 INFO L225 Difference]: With dead ends: 11033 [2019-12-27 07:23:14,503 INFO L226 Difference]: Without dead ends: 11033 [2019-12-27 07:23:14,503 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:23:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11033 states. [2019-12-27 07:23:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11033 to 10642. [2019-12-27 07:23:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10642 states. [2019-12-27 07:23:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10642 states to 10642 states and 32991 transitions. [2019-12-27 07:23:14,673 INFO L78 Accepts]: Start accepts. Automaton has 10642 states and 32991 transitions. Word has length 54 [2019-12-27 07:23:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:14,673 INFO L462 AbstractCegarLoop]: Abstraction has 10642 states and 32991 transitions. [2019-12-27 07:23:14,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:23:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 10642 states and 32991 transitions. [2019-12-27 07:23:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:14,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:14,686 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:23:14,686 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:23:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash -318791943, now seen corresponding path program 1 times [2019-12-27 07:23:14,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:14,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462708104] [2019-12-27 07:23:14,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:15,327 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2019-12-27 07:23:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:23:15,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462708104] [2019-12-27 07:23:15,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:15,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:23:15,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80710016] [2019-12-27 07:23:15,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:23:15,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:15,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:23:15,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:23:15,359 INFO L87 Difference]: Start difference. First operand 10642 states and 32991 transitions. Second operand 16 states. [2019-12-27 07:23:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:18,322 INFO L93 Difference]: Finished difference Result 18375 states and 55754 transitions. [2019-12-27 07:23:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 07:23:18,323 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 07:23:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:18,346 INFO L225 Difference]: With dead ends: 18375 [2019-12-27 07:23:18,346 INFO L226 Difference]: Without dead ends: 14927 [2019-12-27 07:23:18,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 07:23:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14927 states. [2019-12-27 07:23:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14927 to 11446. [2019-12-27 07:23:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11446 states. [2019-12-27 07:23:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11446 states to 11446 states and 35091 transitions. [2019-12-27 07:23:18,544 INFO L78 Accepts]: Start accepts. Automaton has 11446 states and 35091 transitions. Word has length 55 [2019-12-27 07:23:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:18,544 INFO L462 AbstractCegarLoop]: Abstraction has 11446 states and 35091 transitions. [2019-12-27 07:23:18,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:23:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11446 states and 35091 transitions. [2019-12-27 07:23:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:18,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:18,557 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:23:18,557 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:23:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash -670485307, now seen corresponding path program 2 times [2019-12-27 07:23:18,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:18,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099608938] [2019-12-27 07:23:18,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:19,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:23:19,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099608938] [2019-12-27 07:23:19,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:19,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:23:19,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559535100] [2019-12-27 07:23:19,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:23:19,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:23:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:23:19,047 INFO L87 Difference]: Start difference. First operand 11446 states and 35091 transitions. Second operand 16 states. [2019-12-27 07:23:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:22,058 INFO L93 Difference]: Finished difference Result 16667 states and 50169 transitions. [2019-12-27 07:23:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 07:23:22,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 07:23:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:22,080 INFO L225 Difference]: With dead ends: 16667 [2019-12-27 07:23:22,080 INFO L226 Difference]: Without dead ends: 14777 [2019-12-27 07:23:22,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 07:23:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14777 states. [2019-12-27 07:23:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14777 to 11374. [2019-12-27 07:23:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11374 states. [2019-12-27 07:23:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11374 states to 11374 states and 34899 transitions. [2019-12-27 07:23:22,282 INFO L78 Accepts]: Start accepts. Automaton has 11374 states and 34899 transitions. Word has length 55 [2019-12-27 07:23:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:22,282 INFO L462 AbstractCegarLoop]: Abstraction has 11374 states and 34899 transitions. [2019-12-27 07:23:22,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:23:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 11374 states and 34899 transitions. [2019-12-27 07:23:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:22,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:22,295 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:23:22,296 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:23:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1040235271, now seen corresponding path program 3 times [2019-12-27 07:23:22,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:22,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423774490] [2019-12-27 07:23:22,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:22,785 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:23:22,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423774490] [2019-12-27 07:23:22,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:22,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:23:22,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229936351] [2019-12-27 07:23:22,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:23:22,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:23:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:23:22,788 INFO L87 Difference]: Start difference. First operand 11374 states and 34899 transitions. Second operand 16 states. [2019-12-27 07:23:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:26,307 INFO L93 Difference]: Finished difference Result 22500 states and 67582 transitions. [2019-12-27 07:23:26,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 07:23:26,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 07:23:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:26,332 INFO L225 Difference]: With dead ends: 22500 [2019-12-27 07:23:26,332 INFO L226 Difference]: Without dead ends: 16138 [2019-12-27 07:23:26,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=1974, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 07:23:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-12-27 07:23:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 11643. [2019-12-27 07:23:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11643 states. [2019-12-27 07:23:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11643 states to 11643 states and 35376 transitions. [2019-12-27 07:23:26,537 INFO L78 Accepts]: Start accepts. Automaton has 11643 states and 35376 transitions. Word has length 55 [2019-12-27 07:23:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:26,537 INFO L462 AbstractCegarLoop]: Abstraction has 11643 states and 35376 transitions. [2019-12-27 07:23:26,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:23:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11643 states and 35376 transitions. [2019-12-27 07:23:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:26,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:26,549 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:23:26,549 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:23:26,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1381666515, now seen corresponding path program 4 times [2019-12-27 07:23:26,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:26,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743691752] [2019-12-27 07:23:26,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:26,767 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 7 [2019-12-27 07:23:27,240 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:23:27,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743691752] [2019-12-27 07:23:27,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:27,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:23:27,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372170641] [2019-12-27 07:23:27,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:23:27,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:23:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:23:27,242 INFO L87 Difference]: Start difference. First operand 11643 states and 35376 transitions. Second operand 17 states. [2019-12-27 07:23:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:29,868 INFO L93 Difference]: Finished difference Result 18982 states and 56477 transitions. [2019-12-27 07:23:29,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 07:23:29,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 07:23:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:29,891 INFO L225 Difference]: With dead ends: 18982 [2019-12-27 07:23:29,891 INFO L226 Difference]: Without dead ends: 16414 [2019-12-27 07:23:29,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 07:23:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16414 states. [2019-12-27 07:23:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16414 to 11735. [2019-12-27 07:23:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11735 states. [2019-12-27 07:23:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11735 states to 11735 states and 35608 transitions. [2019-12-27 07:23:30,107 INFO L78 Accepts]: Start accepts. Automaton has 11735 states and 35608 transitions. Word has length 55 [2019-12-27 07:23:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:30,108 INFO L462 AbstractCegarLoop]: Abstraction has 11735 states and 35608 transitions. [2019-12-27 07:23:30,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:23:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 11735 states and 35608 transitions. [2019-12-27 07:23:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:30,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:30,121 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:23:30,121 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:23:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1219687005, now seen corresponding path program 5 times [2019-12-27 07:23:30,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:30,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501646290] [2019-12-27 07:23:30,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:30,667 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:23:30,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501646290] [2019-12-27 07:23:30,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:30,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:23:30,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293800050] [2019-12-27 07:23:30,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:23:30,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:23:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:23:30,669 INFO L87 Difference]: Start difference. First operand 11735 states and 35608 transitions. Second operand 16 states. [2019-12-27 07:23:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:33,288 INFO L93 Difference]: Finished difference Result 18158 states and 54416 transitions. [2019-12-27 07:23:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 07:23:33,289 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 07:23:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:33,310 INFO L225 Difference]: With dead ends: 18158 [2019-12-27 07:23:33,310 INFO L226 Difference]: Without dead ends: 16486 [2019-12-27 07:23:33,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 07:23:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16486 states. [2019-12-27 07:23:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16486 to 11843. [2019-12-27 07:23:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2019-12-27 07:23:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 35918 transitions. [2019-12-27 07:23:33,515 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 35918 transitions. Word has length 55 [2019-12-27 07:23:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:33,516 INFO L462 AbstractCegarLoop]: Abstraction has 11843 states and 35918 transitions. [2019-12-27 07:23:33,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:23:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 35918 transitions. [2019-12-27 07:23:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:33,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:33,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:23:33,529 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:23:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -975824335, now seen corresponding path program 6 times [2019-12-27 07:23:33,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:33,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41606971] [2019-12-27 07:23:33,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:34,193 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:23:34,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41606971] [2019-12-27 07:23:34,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:34,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:23:34,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518704465] [2019-12-27 07:23:34,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:23:34,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:23:34,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:23:34,200 INFO L87 Difference]: Start difference. First operand 11843 states and 35918 transitions. Second operand 15 states. [2019-12-27 07:23:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:37,762 INFO L93 Difference]: Finished difference Result 17559 states and 52864 transitions. [2019-12-27 07:23:37,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 07:23:37,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 07:23:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:37,786 INFO L225 Difference]: With dead ends: 17559 [2019-12-27 07:23:37,787 INFO L226 Difference]: Without dead ends: 17019 [2019-12-27 07:23:37,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=457, Invalid=2513, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 07:23:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-27 07:23:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 14171. [2019-12-27 07:23:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14171 states. [2019-12-27 07:23:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14171 states to 14171 states and 43001 transitions. [2019-12-27 07:23:38,022 INFO L78 Accepts]: Start accepts. Automaton has 14171 states and 43001 transitions. Word has length 55 [2019-12-27 07:23:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:38,022 INFO L462 AbstractCegarLoop]: Abstraction has 14171 states and 43001 transitions. [2019-12-27 07:23:38,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:23:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14171 states and 43001 transitions. [2019-12-27 07:23:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:38,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:38,036 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:23:38,036 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:23:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2008156465, now seen corresponding path program 7 times [2019-12-27 07:23:38,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:38,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349886586] [2019-12-27 07:23:38,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:38,463 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:23:38,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349886586] [2019-12-27 07:23:38,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:38,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:23:38,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376001771] [2019-12-27 07:23:38,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:23:38,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:23:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:23:38,465 INFO L87 Difference]: Start difference. First operand 14171 states and 43001 transitions. Second operand 15 states. [2019-12-27 07:23:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:41,821 INFO L93 Difference]: Finished difference Result 17493 states and 52113 transitions. [2019-12-27 07:23:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 07:23:41,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 07:23:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:41,842 INFO L225 Difference]: With dead ends: 17493 [2019-12-27 07:23:41,842 INFO L226 Difference]: Without dead ends: 13875 [2019-12-27 07:23:41,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 07:23:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13875 states. [2019-12-27 07:23:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13875 to 11277. [2019-12-27 07:23:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11277 states. [2019-12-27 07:23:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11277 states to 11277 states and 34427 transitions. [2019-12-27 07:23:42,039 INFO L78 Accepts]: Start accepts. Automaton has 11277 states and 34427 transitions. Word has length 55 [2019-12-27 07:23:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:42,039 INFO L462 AbstractCegarLoop]: Abstraction has 11277 states and 34427 transitions. [2019-12-27 07:23:42,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:23:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11277 states and 34427 transitions. [2019-12-27 07:23:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:42,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:42,054 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:23:42,055 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1048892077, now seen corresponding path program 8 times [2019-12-27 07:23:42,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:42,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420841238] [2019-12-27 07:23:42,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:42,196 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:23:42,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420841238] [2019-12-27 07:23:42,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:42,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:23:42,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651104212] [2019-12-27 07:23:42,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:23:42,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:23:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:23:42,198 INFO L87 Difference]: Start difference. First operand 11277 states and 34427 transitions. Second operand 10 states. [2019-12-27 07:23:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:43,077 INFO L93 Difference]: Finished difference Result 16860 states and 51033 transitions. [2019-12-27 07:23:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:23:43,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 07:23:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:43,094 INFO L225 Difference]: With dead ends: 16860 [2019-12-27 07:23:43,095 INFO L226 Difference]: Without dead ends: 12258 [2019-12-27 07:23:43,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:23:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2019-12-27 07:23:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 11308. [2019-12-27 07:23:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11308 states. [2019-12-27 07:23:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11308 states to 11308 states and 34462 transitions. [2019-12-27 07:23:43,267 INFO L78 Accepts]: Start accepts. Automaton has 11308 states and 34462 transitions. Word has length 55 [2019-12-27 07:23:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:43,267 INFO L462 AbstractCegarLoop]: Abstraction has 11308 states and 34462 transitions. [2019-12-27 07:23:43,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:23:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 11308 states and 34462 transitions. [2019-12-27 07:23:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:43,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:43,280 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:23:43,280 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash -228588437, now seen corresponding path program 9 times [2019-12-27 07:23:43,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:43,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828351760] [2019-12-27 07:23:43,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:43,434 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:23:43,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828351760] [2019-12-27 07:23:43,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:43,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:23:43,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334331831] [2019-12-27 07:23:43,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:23:43,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:23:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:23:43,435 INFO L87 Difference]: Start difference. First operand 11308 states and 34462 transitions. Second operand 10 states. [2019-12-27 07:23:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:45,690 INFO L93 Difference]: Finished difference Result 23291 states and 68175 transitions. [2019-12-27 07:23:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 07:23:45,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 07:23:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:45,720 INFO L225 Difference]: With dead ends: 23291 [2019-12-27 07:23:45,720 INFO L226 Difference]: Without dead ends: 23033 [2019-12-27 07:23:45,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:23:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23033 states. [2019-12-27 07:23:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23033 to 12621. [2019-12-27 07:23:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12621 states. [2019-12-27 07:23:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12621 states to 12621 states and 38298 transitions. [2019-12-27 07:23:45,994 INFO L78 Accepts]: Start accepts. Automaton has 12621 states and 38298 transitions. Word has length 55 [2019-12-27 07:23:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:45,994 INFO L462 AbstractCegarLoop]: Abstraction has 12621 states and 38298 transitions. [2019-12-27 07:23:45,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:23:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 12621 states and 38298 transitions. [2019-12-27 07:23:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:46,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:46,008 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:23:46,008 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1440625269, now seen corresponding path program 10 times [2019-12-27 07:23:46,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:46,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183442767] [2019-12-27 07:23:46,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:46,185 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:23:46,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183442767] [2019-12-27 07:23:46,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:46,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:23:46,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619713407] [2019-12-27 07:23:46,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:23:46,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:23:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:23:46,187 INFO L87 Difference]: Start difference. First operand 12621 states and 38298 transitions. Second operand 11 states. [2019-12-27 07:23:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:47,149 INFO L93 Difference]: Finished difference Result 17609 states and 52520 transitions. [2019-12-27 07:23:47,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:23:47,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 07:23:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:47,170 INFO L225 Difference]: With dead ends: 17609 [2019-12-27 07:23:47,170 INFO L226 Difference]: Without dead ends: 14085 [2019-12-27 07:23:47,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:23:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14085 states. [2019-12-27 07:23:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14085 to 12481. [2019-12-27 07:23:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12481 states. [2019-12-27 07:23:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12481 states to 12481 states and 37836 transitions. [2019-12-27 07:23:47,384 INFO L78 Accepts]: Start accepts. Automaton has 12481 states and 37836 transitions. Word has length 55 [2019-12-27 07:23:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:47,384 INFO L462 AbstractCegarLoop]: Abstraction has 12481 states and 37836 transitions. [2019-12-27 07:23:47,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:23:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 12481 states and 37836 transitions. [2019-12-27 07:23:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:47,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:47,398 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:23:47,399 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash 331505035, now seen corresponding path program 11 times [2019-12-27 07:23:47,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:47,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734972619] [2019-12-27 07:23:47,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:47,561 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:23:47,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734972619] [2019-12-27 07:23:47,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:47,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:23:47,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754885591] [2019-12-27 07:23:47,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:23:47,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:23:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:23:47,562 INFO L87 Difference]: Start difference. First operand 12481 states and 37836 transitions. Second operand 11 states. [2019-12-27 07:23:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:48,642 INFO L93 Difference]: Finished difference Result 15750 states and 47361 transitions. [2019-12-27 07:23:48,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:23:48,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 07:23:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:48,662 INFO L225 Difference]: With dead ends: 15750 [2019-12-27 07:23:48,662 INFO L226 Difference]: Without dead ends: 13644 [2019-12-27 07:23:48,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:23:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13644 states. [2019-12-27 07:23:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13644 to 12671. [2019-12-27 07:23:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12671 states. [2019-12-27 07:23:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12671 states to 12671 states and 38302 transitions. [2019-12-27 07:23:48,861 INFO L78 Accepts]: Start accepts. Automaton has 12671 states and 38302 transitions. Word has length 55 [2019-12-27 07:23:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:48,861 INFO L462 AbstractCegarLoop]: Abstraction has 12671 states and 38302 transitions. [2019-12-27 07:23:48,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:23:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 12671 states and 38302 transitions. [2019-12-27 07:23:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:48,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:48,875 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:23:48,876 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:48,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash -826291291, now seen corresponding path program 12 times [2019-12-27 07:23:48,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:48,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024627101] [2019-12-27 07:23:48,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:49,167 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-12-27 07:23:49,552 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:23:49,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024627101] [2019-12-27 07:23:49,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:49,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:23:49,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580487561] [2019-12-27 07:23:49,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:23:49,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:23:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:23:49,556 INFO L87 Difference]: Start difference. First operand 12671 states and 38302 transitions. Second operand 18 states. [2019-12-27 07:23:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:52,654 INFO L93 Difference]: Finished difference Result 14024 states and 42031 transitions. [2019-12-27 07:23:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 07:23:52,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-27 07:23:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:52,674 INFO L225 Difference]: With dead ends: 14024 [2019-12-27 07:23:52,674 INFO L226 Difference]: Without dead ends: 13500 [2019-12-27 07:23:52,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 07:23:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13500 states. [2019-12-27 07:23:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13500 to 12748. [2019-12-27 07:23:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12748 states. [2019-12-27 07:23:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12748 states to 12748 states and 38492 transitions. [2019-12-27 07:23:52,874 INFO L78 Accepts]: Start accepts. Automaton has 12748 states and 38492 transitions. Word has length 55 [2019-12-27 07:23:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:52,874 INFO L462 AbstractCegarLoop]: Abstraction has 12748 states and 38492 transitions. [2019-12-27 07:23:52,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:23:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12748 states and 38492 transitions. [2019-12-27 07:23:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:52,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:52,887 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:23:52,887 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash -830533993, now seen corresponding path program 13 times [2019-12-27 07:23:52,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:52,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538348223] [2019-12-27 07:23:52,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:23:53,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538348223] [2019-12-27 07:23:53,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:53,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:23:53,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411109149] [2019-12-27 07:23:53,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:23:53,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:53,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:23:53,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:23:53,373 INFO L87 Difference]: Start difference. First operand 12748 states and 38492 transitions. Second operand 17 states. [2019-12-27 07:23:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:56,573 INFO L93 Difference]: Finished difference Result 15474 states and 46478 transitions. [2019-12-27 07:23:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 07:23:56,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 07:23:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:56,693 INFO L225 Difference]: With dead ends: 15474 [2019-12-27 07:23:56,693 INFO L226 Difference]: Without dead ends: 14500 [2019-12-27 07:23:56,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=326, Invalid=1930, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 07:23:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14500 states. [2019-12-27 07:23:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14500 to 13875. [2019-12-27 07:23:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13875 states. [2019-12-27 07:23:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13875 states to 13875 states and 41843 transitions. [2019-12-27 07:23:56,901 INFO L78 Accepts]: Start accepts. Automaton has 13875 states and 41843 transitions. Word has length 55 [2019-12-27 07:23:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:56,901 INFO L462 AbstractCegarLoop]: Abstraction has 13875 states and 41843 transitions. [2019-12-27 07:23:56,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:23:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13875 states and 41843 transitions. [2019-12-27 07:23:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:56,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:56,916 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:23:56,917 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:56,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2141520489, now seen corresponding path program 14 times [2019-12-27 07:23:56,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:56,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038727121] [2019-12-27 07:23:56,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:57,081 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:23:57,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038727121] [2019-12-27 07:23:57,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:57,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:23:57,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928247099] [2019-12-27 07:23:57,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:23:57,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:23:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:23:57,083 INFO L87 Difference]: Start difference. First operand 13875 states and 41843 transitions. Second operand 11 states. [2019-12-27 07:23:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:57,899 INFO L93 Difference]: Finished difference Result 18446 states and 54896 transitions. [2019-12-27 07:23:57,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 07:23:57,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 07:23:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:57,918 INFO L225 Difference]: With dead ends: 18446 [2019-12-27 07:23:57,918 INFO L226 Difference]: Without dead ends: 12756 [2019-12-27 07:23:57,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-27 07:23:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12756 states. [2019-12-27 07:23:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12756 to 11552. [2019-12-27 07:23:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11552 states. [2019-12-27 07:23:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11552 states to 11552 states and 35166 transitions. [2019-12-27 07:23:58,119 INFO L78 Accepts]: Start accepts. Automaton has 11552 states and 35166 transitions. Word has length 55 [2019-12-27 07:23:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:58,119 INFO L462 AbstractCegarLoop]: Abstraction has 11552 states and 35166 transitions. [2019-12-27 07:23:58,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:23:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 11552 states and 35166 transitions. [2019-12-27 07:23:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:23:58,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:58,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:23:58,133 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash 975434899, now seen corresponding path program 15 times [2019-12-27 07:23:58,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:58,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986934665] [2019-12-27 07:23:58,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:58,188 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:23:58,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986934665] [2019-12-27 07:23:58,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:58,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:23:58,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794375844] [2019-12-27 07:23:58,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:23:58,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:23:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:23:58,190 INFO L87 Difference]: Start difference. First operand 11552 states and 35166 transitions. Second operand 3 states. [2019-12-27 07:23:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:58,245 INFO L93 Difference]: Finished difference Result 11552 states and 35164 transitions. [2019-12-27 07:23:58,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:23:58,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:23:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:58,268 INFO L225 Difference]: With dead ends: 11552 [2019-12-27 07:23:58,268 INFO L226 Difference]: Without dead ends: 11552 [2019-12-27 07:23:58,269 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:23:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11552 states. [2019-12-27 07:23:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11552 to 10637. [2019-12-27 07:23:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10637 states. [2019-12-27 07:23:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10637 states to 10637 states and 32686 transitions. [2019-12-27 07:23:58,573 INFO L78 Accepts]: Start accepts. Automaton has 10637 states and 32686 transitions. Word has length 55 [2019-12-27 07:23:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:58,573 INFO L462 AbstractCegarLoop]: Abstraction has 10637 states and 32686 transitions. [2019-12-27 07:23:58,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:23:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 10637 states and 32686 transitions. [2019-12-27 07:23:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:23:58,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:58,591 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:23:58,591 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1755725825, now seen corresponding path program 1 times [2019-12-27 07:23:58,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:58,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622985444] [2019-12-27 07:23:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:23:58,748 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:23:58,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622985444] [2019-12-27 07:23:58,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:23:58,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:23:58,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554843809] [2019-12-27 07:23:58,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:23:58,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:23:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:23:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:23:58,750 INFO L87 Difference]: Start difference. First operand 10637 states and 32686 transitions. Second operand 11 states. [2019-12-27 07:23:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:23:59,602 INFO L93 Difference]: Finished difference Result 11745 states and 35537 transitions. [2019-12-27 07:23:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:23:59,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 07:23:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:23:59,619 INFO L225 Difference]: With dead ends: 11745 [2019-12-27 07:23:59,619 INFO L226 Difference]: Without dead ends: 11507 [2019-12-27 07:23:59,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:23:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2019-12-27 07:23:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 10529. [2019-12-27 07:23:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10529 states. [2019-12-27 07:23:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 32426 transitions. [2019-12-27 07:23:59,789 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 32426 transitions. Word has length 56 [2019-12-27 07:23:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:23:59,789 INFO L462 AbstractCegarLoop]: Abstraction has 10529 states and 32426 transitions. [2019-12-27 07:23:59,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:23:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 32426 transitions. [2019-12-27 07:23:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:23:59,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:23:59,801 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:23:59,801 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:23:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:23:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1747486899, now seen corresponding path program 2 times [2019-12-27 07:23:59,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:23:59,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061415590] [2019-12-27 07:23:59,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:23:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:23:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:23:59,944 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:23:59,944 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:23:59,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_43 0) (= 0 v_~x$w_buff0_used~0_108) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1828~0.base_27| 4)) (= v_~main$tmp_guard1~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_27|)) (= 0 v_~x$r_buff0_thd3~0_21) (= 0 v_~x$w_buff1~0_25) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_27| 1)) (= 0 |v_ULTIMATE.start_main_~#t1828~0.offset_19|) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#NULL.offset_3| 0) (= v_~x~0_26 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~y~0_19 0) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~weak$$choice2~0_32) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$w_buff0~0_25) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~x$flush_delayed~0_14 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_27|) |v_ULTIMATE.start_main_~#t1828~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~x$r_buff0_thd1~0_74) (= v_~x$r_buff1_thd3~0_18 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= v_~x$mem_tmp~0_11 0) (= 0 v_~__unbuffered_cnt~0_22) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1828~0.base_27|) (= v_~x$r_buff1_thd2~0_20 0) (= v_~__unbuffered_p0_EBX~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_14|, ULTIMATE.start_main_~#t1828~0.offset=|v_ULTIMATE.start_main_~#t1828~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_~#t1828~0.base=|v_ULTIMATE.start_main_~#t1828~0.base_27|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_74, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_19, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108, 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_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1830~0.base, #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, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1830~0.offset, ULTIMATE.start_main_~#t1828~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1829~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1829~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1828~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~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_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:23:59,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L816-1-->L818: Formula: (and (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10|) |v_ULTIMATE.start_main_~#t1829~0.offset_10| 1))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1829~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1829~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1829~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1829~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1829~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1829~0.base] because there is no mapped edge [2019-12-27 07:23:59,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L818-1-->L820: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1830~0.base_10| 4) |v_#length_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1830~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10|) |v_ULTIMATE.start_main_~#t1830~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1830~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1830~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1830~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:23:59,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:23:59,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In364697305 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In364697305 256)))) (or (and (= ~x$w_buff1~0_In364697305 |P2Thread1of1ForFork1_#t~ite32_Out364697305|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In364697305 |P2Thread1of1ForFork1_#t~ite32_Out364697305|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In364697305, ~x$w_buff1_used~0=~x$w_buff1_used~0_In364697305, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In364697305, ~x~0=~x~0_In364697305} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out364697305|, ~x$w_buff1~0=~x$w_buff1~0_In364697305, ~x$w_buff1_used~0=~x$w_buff1_used~0_In364697305, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In364697305, ~x~0=~x~0_In364697305} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:23:59,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2028952413 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In2028952413 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out2028952413| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out2028952413| ~x$w_buff0_used~0_In2028952413)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2028952413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028952413} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2028952413, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2028952413|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028952413} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:23:59,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_19 |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_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:23:59,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1202127546 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1202127546 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1202127546 |P2Thread1of1ForFork1_#t~ite34_Out-1202127546|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1202127546|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1202127546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1202127546} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1202127546|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1202127546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1202127546} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:23:59,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-2118963449 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2118963449 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-2118963449 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2118963449 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-2118963449| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2118963449 |P1Thread1of1ForFork0_#t~ite29_Out-2118963449|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2118963449, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2118963449, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2118963449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2118963449} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2118963449, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2118963449, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2118963449, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2118963449|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2118963449} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:23:59,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1507371535 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1507371535 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In1507371535 ~x$r_buff0_thd2~0_Out1507371535) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out1507371535 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1507371535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1507371535} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1507371535|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1507371535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1507371535} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:23:59,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1262151967 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1262151967 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1262151967 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1262151967 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1262151967| ~x$r_buff1_thd2~0_In-1262151967) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1262151967| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1262151967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1262151967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1262151967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1262151967} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1262151967|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1262151967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1262151967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1262151967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1262151967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:23:59,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_16 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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:23:59,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1763353468 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1763353468 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1763353468 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1763353468 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1763353468|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1763353468 |P2Thread1of1ForFork1_#t~ite35_Out1763353468|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1763353468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1763353468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1763353468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1763353468} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1763353468|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1763353468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1763353468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1763353468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1763353468} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:23:59,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-161522478 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-161522478 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-161522478|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-161522478 |P2Thread1of1ForFork1_#t~ite36_Out-161522478|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-161522478, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161522478} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-161522478|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-161522478, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161522478} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:23:59,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In402260255 256) 0))) (or (and (= ~x$w_buff1~0_In402260255 |P0Thread1of1ForFork2_#t~ite12_Out402260255|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In402260255| |P0Thread1of1ForFork2_#t~ite11_Out402260255|)) (and (= |P0Thread1of1ForFork2_#t~ite11_Out402260255| |P0Thread1of1ForFork2_#t~ite12_Out402260255|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In402260255 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In402260255 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In402260255 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In402260255 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite11_Out402260255| ~x$w_buff1~0_In402260255) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402260255, ~x$w_buff1~0=~x$w_buff1~0_In402260255, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402260255, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402260255, ~weak$$choice2~0=~weak$$choice2~0_In402260255, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In402260255|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402260255} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402260255, ~x$w_buff1~0=~x$w_buff1~0_In402260255, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402260255, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402260255, ~weak$$choice2~0=~weak$$choice2~0_In402260255, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out402260255|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out402260255|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402260255} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 07:23:59,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-627860838 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In-627860838| |P0Thread1of1ForFork2_#t~ite14_Out-627860838|) (= ~x$w_buff0_used~0_In-627860838 |P0Thread1of1ForFork2_#t~ite15_Out-627860838|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-627860838 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-627860838 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-627860838 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-627860838 256)) .cse1))) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out-627860838| |P0Thread1of1ForFork2_#t~ite15_Out-627860838|) (= ~x$w_buff0_used~0_In-627860838 |P0Thread1of1ForFork2_#t~ite14_Out-627860838|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-627860838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-627860838, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-627860838, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-627860838|, ~weak$$choice2~0=~weak$$choice2~0_In-627860838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-627860838} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-627860838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-627860838, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-627860838|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-627860838, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-627860838|, ~weak$$choice2~0=~weak$$choice2~0_In-627860838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-627860838} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 07:23:59,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_54 v_~x$r_buff0_thd1~0_53) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} 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:23:59,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2048499369 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In2048499369| |P0Thread1of1ForFork2_#t~ite23_Out2048499369|) (= ~x$r_buff1_thd1~0_In2048499369 |P0Thread1of1ForFork2_#t~ite24_Out2048499369|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2048499369 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In2048499369 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In2048499369 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In2048499369 256) 0)))) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out2048499369| |P0Thread1of1ForFork2_#t~ite24_Out2048499369|) (= ~x$r_buff1_thd1~0_In2048499369 |P0Thread1of1ForFork2_#t~ite23_Out2048499369|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2048499369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048499369, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2048499369, ~weak$$choice2~0=~weak$$choice2~0_In2048499369, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In2048499369|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048499369} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2048499369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048499369, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2048499369, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out2048499369|, ~weak$$choice2~0=~weak$$choice2~0_In2048499369, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out2048499369|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048499369} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 07:23:59,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~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} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:23:59,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1499269455 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1499269455 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1499269455 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1499269455 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1499269455| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1499269455| ~x$r_buff1_thd3~0_In1499269455) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1499269455, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1499269455, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1499269455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499269455} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1499269455|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1499269455, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1499269455, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1499269455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499269455} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:23:59,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} 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_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, 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:23:59,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:23:59,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-1566956027| |ULTIMATE.start_main_#t~ite41_Out-1566956027|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1566956027 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1566956027 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1566956027 |ULTIMATE.start_main_#t~ite41_Out-1566956027|) .cse2) (and (= ~x~0_In-1566956027 |ULTIMATE.start_main_#t~ite41_Out-1566956027|) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1566956027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1566956027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1566956027, ~x~0=~x~0_In-1566956027} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1566956027|, ~x$w_buff1~0=~x$w_buff1~0_In-1566956027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1566956027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1566956027, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1566956027|, ~x~0=~x~0_In-1566956027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:23:59,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In527784126 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In527784126 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out527784126| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out527784126| ~x$w_buff0_used~0_In527784126) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In527784126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527784126} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In527784126, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out527784126|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527784126} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:23:59,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-436589967 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-436589967 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-436589967 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-436589967 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-436589967 |ULTIMATE.start_main_#t~ite44_Out-436589967|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-436589967|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-436589967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-436589967, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-436589967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-436589967} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-436589967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-436589967, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-436589967, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-436589967|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-436589967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:23:59,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1050148256 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1050148256 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1050148256| ~x$r_buff0_thd0~0_In1050148256) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1050148256|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1050148256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1050148256} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1050148256, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1050148256|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1050148256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:23:59,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-704822734 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-704822734 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-704822734 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-704822734 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-704822734| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-704822734 |ULTIMATE.start_main_#t~ite46_Out-704822734|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-704822734, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-704822734, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-704822734, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-704822734} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-704822734, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-704822734|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-704822734, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-704822734, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-704822734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:23:59,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p0_EAX~0_9 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13, ~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:24:00,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:24:00 BasicIcfg [2019-12-27 07:24:00,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:24:00,071 INFO L168 Benchmark]: Toolchain (without parser) took 97848.93 ms. Allocated memory was 137.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 99.8 MB in the beginning and 670.5 MB in the end (delta: -570.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 07:24:00,071 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 07:24:00,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.69 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 155.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:24:00,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.58 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:24:00,076 INFO L168 Benchmark]: Boogie Preprocessor took 38.76 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:24:00,076 INFO L168 Benchmark]: RCFGBuilder took 793.57 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 104.0 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:24:00,077 INFO L168 Benchmark]: TraceAbstraction took 96172.92 ms. Allocated memory was 201.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 104.0 MB in the beginning and 670.5 MB in the end (delta: -566.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 07:24:00,078 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.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.69 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 155.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.58 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.76 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.57 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 104.0 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96172.92 ms. Allocated memory was 201.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 104.0 MB in the beginning and 670.5 MB in the end (delta: -566.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 93 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6473 VarBasedMoverChecksPositive, 209 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75395 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L818] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] 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_p0_EBX=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] [L820] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2] [L793] 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_p0_EBX=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=2] [L773] 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 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=7, 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=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] 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=2, __unbuffered_p0_EBX=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=7, 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=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=2] [L737] 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) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=7, weak$$choice2=1, 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))=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=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=7, weak$$choice2=1, 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))=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=7, 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=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=7, 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=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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: 95.8s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 48.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6276 SDtfs, 11326 SDslu, 27196 SDs, 0 SdLazy, 32115 SolverSat, 744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 705 GetRequests, 40 SyntacticMatches, 43 SemanticMatches, 622 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5611 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 120827 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1616 NumberOfCodeBlocks, 1616 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1526 ConstructedInterpolants, 0 QuantifiedInterpolants, 402981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...