/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:18:48,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:18:48,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:18:48,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:18:48,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:18:48,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:18:48,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:18:48,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:18:48,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:18:48,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:18:48,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:18:48,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:18:48,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:18:48,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:18:48,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:18:48,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:18:48,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:18:48,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:18:48,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:18:48,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:18:48,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:18:48,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:18:48,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:18:48,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:18:48,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:18:48,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:18:48,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:18:48,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:18:48,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:18:48,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:18:48,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:18:48,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:18:48,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:18:48,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:18:48,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:18:48,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:18:48,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:18:48,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:18:48,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:18:48,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:18:48,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:18:48,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:18:48,907 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:18:48,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:18:48,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:18:48,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:18:48,912 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:18:48,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:18:48,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:18:48,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:18:48,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:18:48,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:18:48,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:18:48,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:18:48,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:18:48,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:18:48,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:18:48,914 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:18:48,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:18:48,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:18:48,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:18:48,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:18:48,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:18:48,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:18:48,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:18:48,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:18:48,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:18:48,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:18:48,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:18:48,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:18:48,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:18:49,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:18:49,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:18:49,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:18:49,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:18:49,222 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:18:49,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-27 02:18:49,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c205d6218/5f07a8fa7d23457d8e84c2108c2e9778/FLAG375fec471 [2019-12-27 02:18:49,828 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:18:49,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-27 02:18:49,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c205d6218/5f07a8fa7d23457d8e84c2108c2e9778/FLAG375fec471 [2019-12-27 02:18:50,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c205d6218/5f07a8fa7d23457d8e84c2108c2e9778 [2019-12-27 02:18:50,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:18:50,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:18:50,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:50,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:18:50,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:18:50,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:50,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a48cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50, skipping insertion in model container [2019-12-27 02:18:50,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:50,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:18:50,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:18:50,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:50,824 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:18:50,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:50,970 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:18:50,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50 WrapperNode [2019-12-27 02:18:50,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:50,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:50,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:18:50,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:18:50,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:51,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:18:51,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:18:51,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:18:51,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... [2019-12-27 02:18:51,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:18:51,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:18:51,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:18:51,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:18:51,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:18:51,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:18:51,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:18:51,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:18:51,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:18:51,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:18:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:18:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:18:51,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:18:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:18:51,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:18:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:18:51,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:18:51,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:18:51,163 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:18:51,898 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:18:51,898 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:18:51,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:51 BoogieIcfgContainer [2019-12-27 02:18:51,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:18:51,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:18:51,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:18:51,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:18:51,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:18:50" (1/3) ... [2019-12-27 02:18:51,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581d3425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:51, skipping insertion in model container [2019-12-27 02:18:51,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:50" (2/3) ... [2019-12-27 02:18:51,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581d3425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:51, skipping insertion in model container [2019-12-27 02:18:51,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:51" (3/3) ... [2019-12-27 02:18:51,912 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2019-12-27 02:18:51,923 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:18:51,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:18:51,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:18:51,936 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:18:51,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:51,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,064 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,064 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:52,101 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:18:52,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:18:52,119 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:18:52,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:18:52,119 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:18:52,119 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:18:52,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:18:52,119 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:18:52,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:18:52,136 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 02:18:52,137 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 02:18:52,251 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 02:18:52,252 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:52,270 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 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/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:18:52,292 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 02:18:52,393 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 02:18:52,394 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:52,405 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 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/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:18:52,428 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 02:18:52,429 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:18:57,867 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:18:57,999 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:18:58,115 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66821 [2019-12-27 02:18:58,115 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 02:18:58,123 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-27 02:19:10,144 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 02:19:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 02:19:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 02:19:10,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:10,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 02:19:10,152 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash 802094366, now seen corresponding path program 1 times [2019-12-27 02:19:10,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:10,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736533693] [2019-12-27 02:19:10,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:10,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736533693] [2019-12-27 02:19:10,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:10,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:19:10,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783161148] [2019-12-27 02:19:10,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:10,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:10,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:10,468 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 02:19:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:13,273 INFO L93 Difference]: Finished difference Result 87938 states and 378592 transitions. [2019-12-27 02:19:13,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:13,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 02:19:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:13,833 INFO L225 Difference]: With dead ends: 87938 [2019-12-27 02:19:13,833 INFO L226 Difference]: Without dead ends: 82842 [2019-12-27 02:19:13,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82842 states. [2019-12-27 02:19:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82842 to 82842. [2019-12-27 02:19:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82842 states. [2019-12-27 02:19:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82842 states to 82842 states and 356178 transitions. [2019-12-27 02:19:22,667 INFO L78 Accepts]: Start accepts. Automaton has 82842 states and 356178 transitions. Word has length 5 [2019-12-27 02:19:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:22,667 INFO L462 AbstractCegarLoop]: Abstraction has 82842 states and 356178 transitions. [2019-12-27 02:19:22,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 82842 states and 356178 transitions. [2019-12-27 02:19:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:19:22,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:22,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:22,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash -136321435, now seen corresponding path program 1 times [2019-12-27 02:19:22,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:22,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095118506] [2019-12-27 02:19:22,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:22,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095118506] [2019-12-27 02:19:22,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:22,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:22,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069693652] [2019-12-27 02:19:22,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:22,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:22,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:22,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:22,784 INFO L87 Difference]: Start difference. First operand 82842 states and 356178 transitions. Second operand 3 states. [2019-12-27 02:19:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:23,021 INFO L93 Difference]: Finished difference Result 21610 states and 74688 transitions. [2019-12-27 02:19:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:23,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:19:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:23,086 INFO L225 Difference]: With dead ends: 21610 [2019-12-27 02:19:23,086 INFO L226 Difference]: Without dead ends: 21610 [2019-12-27 02:19:23,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21610 states. [2019-12-27 02:19:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21610 to 21610. [2019-12-27 02:19:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21610 states. [2019-12-27 02:19:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21610 states to 21610 states and 74688 transitions. [2019-12-27 02:19:26,660 INFO L78 Accepts]: Start accepts. Automaton has 21610 states and 74688 transitions. Word has length 13 [2019-12-27 02:19:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:26,660 INFO L462 AbstractCegarLoop]: Abstraction has 21610 states and 74688 transitions. [2019-12-27 02:19:26,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21610 states and 74688 transitions. [2019-12-27 02:19:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:19:26,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:26,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:26,663 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash -120546049, now seen corresponding path program 1 times [2019-12-27 02:19:26,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:26,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429461396] [2019-12-27 02:19:26,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:26,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 02:19:26,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429461396] [2019-12-27 02:19:26,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:26,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:26,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317910360] [2019-12-27 02:19:26,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:19:26,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:26,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:19:26,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:26,788 INFO L87 Difference]: Start difference. First operand 21610 states and 74688 transitions. Second operand 4 states. [2019-12-27 02:19:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:27,152 INFO L93 Difference]: Finished difference Result 31986 states and 107232 transitions. [2019-12-27 02:19:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:19:27,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:19:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:27,271 INFO L225 Difference]: With dead ends: 31986 [2019-12-27 02:19:27,271 INFO L226 Difference]: Without dead ends: 31972 [2019-12-27 02:19:27,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31972 states. [2019-12-27 02:19:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31972 to 28300. [2019-12-27 02:19:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28300 states. [2019-12-27 02:19:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28300 states to 28300 states and 95848 transitions. [2019-12-27 02:19:28,233 INFO L78 Accepts]: Start accepts. Automaton has 28300 states and 95848 transitions. Word has length 13 [2019-12-27 02:19:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:28,233 INFO L462 AbstractCegarLoop]: Abstraction has 28300 states and 95848 transitions. [2019-12-27 02:19:28,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:19:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28300 states and 95848 transitions. [2019-12-27 02:19:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:19:28,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:28,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:28,237 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2051868705, now seen corresponding path program 1 times [2019-12-27 02:19:28,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:28,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173886572] [2019-12-27 02:19:28,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:28,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173886572] [2019-12-27 02:19:28,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:28,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:28,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71195253] [2019-12-27 02:19:28,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:28,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:28,380 INFO L87 Difference]: Start difference. First operand 28300 states and 95848 transitions. Second operand 5 states. [2019-12-27 02:19:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:29,138 INFO L93 Difference]: Finished difference Result 42745 states and 142288 transitions. [2019-12-27 02:19:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:19:29,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 02:19:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:29,243 INFO L225 Difference]: With dead ends: 42745 [2019-12-27 02:19:29,243 INFO L226 Difference]: Without dead ends: 42727 [2019-12-27 02:19:29,243 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 02:19:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42727 states. [2019-12-27 02:19:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42727 to 34163. [2019-12-27 02:19:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34163 states. [2019-12-27 02:19:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34163 states to 34163 states and 114786 transitions. [2019-12-27 02:19:30,189 INFO L78 Accepts]: Start accepts. Automaton has 34163 states and 114786 transitions. Word has length 14 [2019-12-27 02:19:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:30,190 INFO L462 AbstractCegarLoop]: Abstraction has 34163 states and 114786 transitions. [2019-12-27 02:19:30,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 34163 states and 114786 transitions. [2019-12-27 02:19:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:19:30,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:30,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:30,202 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1808091808, now seen corresponding path program 1 times [2019-12-27 02:19:30,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:30,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927386540] [2019-12-27 02:19:30,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:30,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927386540] [2019-12-27 02:19:30,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:30,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:19:30,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357373336] [2019-12-27 02:19:30,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:19:30,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:30,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:19:30,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:19:30,361 INFO L87 Difference]: Start difference. First operand 34163 states and 114786 transitions. Second operand 6 states. [2019-12-27 02:19:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:31,599 INFO L93 Difference]: Finished difference Result 52347 states and 172257 transitions. [2019-12-27 02:19:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:19:31,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:19:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:31,691 INFO L225 Difference]: With dead ends: 52347 [2019-12-27 02:19:31,692 INFO L226 Difference]: Without dead ends: 52317 [2019-12-27 02:19:31,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:19:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52317 states. [2019-12-27 02:19:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52317 to 34394. [2019-12-27 02:19:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34394 states. [2019-12-27 02:19:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34394 states to 34394 states and 114647 transitions. [2019-12-27 02:19:32,505 INFO L78 Accepts]: Start accepts. Automaton has 34394 states and 114647 transitions. Word has length 22 [2019-12-27 02:19:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:32,505 INFO L462 AbstractCegarLoop]: Abstraction has 34394 states and 114647 transitions. [2019-12-27 02:19:32,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:19:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 34394 states and 114647 transitions. [2019-12-27 02:19:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:19:32,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:32,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:32,520 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1844565345, now seen corresponding path program 1 times [2019-12-27 02:19:32,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:32,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719865948] [2019-12-27 02:19:32,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:32,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719865948] [2019-12-27 02:19:32,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:32,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:32,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098583397] [2019-12-27 02:19:32,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:19:32,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:19:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:32,576 INFO L87 Difference]: Start difference. First operand 34394 states and 114647 transitions. Second operand 4 states. [2019-12-27 02:19:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:32,826 INFO L93 Difference]: Finished difference Result 13523 states and 41801 transitions. [2019-12-27 02:19:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:19:32,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:19:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:32,845 INFO L225 Difference]: With dead ends: 13523 [2019-12-27 02:19:32,845 INFO L226 Difference]: Without dead ends: 13523 [2019-12-27 02:19:32,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2019-12-27 02:19:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 13303. [2019-12-27 02:19:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13303 states. [2019-12-27 02:19:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 41151 transitions. [2019-12-27 02:19:33,043 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 41151 transitions. Word has length 25 [2019-12-27 02:19:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:33,044 INFO L462 AbstractCegarLoop]: Abstraction has 13303 states and 41151 transitions. [2019-12-27 02:19:33,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:19:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 41151 transitions. [2019-12-27 02:19:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:19:33,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:33,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:33,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1639479592, now seen corresponding path program 1 times [2019-12-27 02:19:33,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:33,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660118228] [2019-12-27 02:19:33,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:33,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660118228] [2019-12-27 02:19:33,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:33,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:33,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22899471] [2019-12-27 02:19:33,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:33,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:33,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:33,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:33,182 INFO L87 Difference]: Start difference. First operand 13303 states and 41151 transitions. Second operand 3 states. [2019-12-27 02:19:33,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:33,237 INFO L93 Difference]: Finished difference Result 12716 states and 38855 transitions. [2019-12-27 02:19:33,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:33,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:19:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:33,254 INFO L225 Difference]: With dead ends: 12716 [2019-12-27 02:19:33,254 INFO L226 Difference]: Without dead ends: 12716 [2019-12-27 02:19:33,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2019-12-27 02:19:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 12700. [2019-12-27 02:19:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12700 states. [2019-12-27 02:19:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 38815 transitions. [2019-12-27 02:19:33,457 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 38815 transitions. Word has length 39 [2019-12-27 02:19:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:33,457 INFO L462 AbstractCegarLoop]: Abstraction has 12700 states and 38815 transitions. [2019-12-27 02:19:33,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 38815 transitions. [2019-12-27 02:19:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:19:33,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:33,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:33,477 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1144095462, now seen corresponding path program 1 times [2019-12-27 02:19:33,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:33,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144551502] [2019-12-27 02:19:33,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:33,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144551502] [2019-12-27 02:19:33,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:33,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:19:33,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481140216] [2019-12-27 02:19:33,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:33,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:33,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:33,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:33,579 INFO L87 Difference]: Start difference. First operand 12700 states and 38815 transitions. Second operand 5 states. [2019-12-27 02:19:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:34,077 INFO L93 Difference]: Finished difference Result 17919 states and 54342 transitions. [2019-12-27 02:19:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:19:34,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:19:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:34,102 INFO L225 Difference]: With dead ends: 17919 [2019-12-27 02:19:34,103 INFO L226 Difference]: Without dead ends: 17919 [2019-12-27 02:19:34,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:19:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17919 states. [2019-12-27 02:19:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17919 to 16320. [2019-12-27 02:19:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16320 states. [2019-12-27 02:19:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 49873 transitions. [2019-12-27 02:19:34,340 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 49873 transitions. Word has length 40 [2019-12-27 02:19:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:34,340 INFO L462 AbstractCegarLoop]: Abstraction has 16320 states and 49873 transitions. [2019-12-27 02:19:34,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 49873 transitions. [2019-12-27 02:19:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:19:34,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:34,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:34,363 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2007286560, now seen corresponding path program 2 times [2019-12-27 02:19:34,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:34,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90891709] [2019-12-27 02:19:34,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:34,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90891709] [2019-12-27 02:19:34,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:34,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:19:34,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493580557] [2019-12-27 02:19:34,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:19:34,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:19:34,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:34,427 INFO L87 Difference]: Start difference. First operand 16320 states and 49873 transitions. Second operand 5 states. [2019-12-27 02:19:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:34,643 INFO L93 Difference]: Finished difference Result 14953 states and 46364 transitions. [2019-12-27 02:19:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:19:34,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:19:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:34,670 INFO L225 Difference]: With dead ends: 14953 [2019-12-27 02:19:34,670 INFO L226 Difference]: Without dead ends: 14953 [2019-12-27 02:19:34,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:19:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14953 states. [2019-12-27 02:19:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14953 to 13921. [2019-12-27 02:19:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13921 states. [2019-12-27 02:19:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13921 states to 13921 states and 43359 transitions. [2019-12-27 02:19:34,905 INFO L78 Accepts]: Start accepts. Automaton has 13921 states and 43359 transitions. Word has length 40 [2019-12-27 02:19:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:34,905 INFO L462 AbstractCegarLoop]: Abstraction has 13921 states and 43359 transitions. [2019-12-27 02:19:34,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:19:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 13921 states and 43359 transitions. [2019-12-27 02:19:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:34,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:34,929 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 02:19:34,929 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 425228576, now seen corresponding path program 1 times [2019-12-27 02:19:34,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:34,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506082651] [2019-12-27 02:19:34,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:35,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506082651] [2019-12-27 02:19:35,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:35,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:19:35,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852843260] [2019-12-27 02:19:35,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:19:35,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:35,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:19:35,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:19:35,089 INFO L87 Difference]: Start difference. First operand 13921 states and 43359 transitions. Second operand 9 states. [2019-12-27 02:19:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:36,469 INFO L93 Difference]: Finished difference Result 31249 states and 96830 transitions. [2019-12-27 02:19:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:19:36,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 02:19:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:36,502 INFO L225 Difference]: With dead ends: 31249 [2019-12-27 02:19:36,502 INFO L226 Difference]: Without dead ends: 22250 [2019-12-27 02:19:36,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:19:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22250 states. [2019-12-27 02:19:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22250 to 17210. [2019-12-27 02:19:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17210 states. [2019-12-27 02:19:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17210 states to 17210 states and 53206 transitions. [2019-12-27 02:19:36,827 INFO L78 Accepts]: Start accepts. Automaton has 17210 states and 53206 transitions. Word has length 55 [2019-12-27 02:19:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:36,827 INFO L462 AbstractCegarLoop]: Abstraction has 17210 states and 53206 transitions. [2019-12-27 02:19:36,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:19:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 17210 states and 53206 transitions. [2019-12-27 02:19:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:36,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:36,848 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 02:19:36,848 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash 235395682, now seen corresponding path program 2 times [2019-12-27 02:19:36,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:36,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911573119] [2019-12-27 02:19:36,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:36,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911573119] [2019-12-27 02:19:36,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:36,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:19:36,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340244176] [2019-12-27 02:19:36,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:36,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:36,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:36,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:36,906 INFO L87 Difference]: Start difference. First operand 17210 states and 53206 transitions. Second operand 3 states. [2019-12-27 02:19:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:37,029 INFO L93 Difference]: Finished difference Result 23156 states and 70253 transitions. [2019-12-27 02:19:37,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:37,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:19:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:37,063 INFO L225 Difference]: With dead ends: 23156 [2019-12-27 02:19:37,063 INFO L226 Difference]: Without dead ends: 23156 [2019-12-27 02:19:37,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23156 states. [2019-12-27 02:19:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23156 to 19339. [2019-12-27 02:19:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19339 states. [2019-12-27 02:19:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19339 states to 19339 states and 59397 transitions. [2019-12-27 02:19:37,531 INFO L78 Accepts]: Start accepts. Automaton has 19339 states and 59397 transitions. Word has length 55 [2019-12-27 02:19:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:37,532 INFO L462 AbstractCegarLoop]: Abstraction has 19339 states and 59397 transitions. [2019-12-27 02:19:37,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19339 states and 59397 transitions. [2019-12-27 02:19:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:37,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:37,555 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 02:19:37,555 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash 579382589, now seen corresponding path program 1 times [2019-12-27 02:19:37,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:37,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941663535] [2019-12-27 02:19:37,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:37,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941663535] [2019-12-27 02:19:37,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:37,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:19:37,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550917591] [2019-12-27 02:19:37,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:19:37,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:19:37,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:19:37,711 INFO L87 Difference]: Start difference. First operand 19339 states and 59397 transitions. Second operand 10 states. [2019-12-27 02:19:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:40,635 INFO L93 Difference]: Finished difference Result 35706 states and 106178 transitions. [2019-12-27 02:19:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 02:19:40,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 02:19:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:40,690 INFO L225 Difference]: With dead ends: 35706 [2019-12-27 02:19:40,690 INFO L226 Difference]: Without dead ends: 35502 [2019-12-27 02:19:40,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 02:19:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35502 states. [2019-12-27 02:19:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35502 to 20462. [2019-12-27 02:19:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20462 states. [2019-12-27 02:19:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 62626 transitions. [2019-12-27 02:19:41,366 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 62626 transitions. Word has length 55 [2019-12-27 02:19:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:41,367 INFO L462 AbstractCegarLoop]: Abstraction has 20462 states and 62626 transitions. [2019-12-27 02:19:41,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:19:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 62626 transitions. [2019-12-27 02:19:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:41,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:41,399 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 02:19:41,399 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:41,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1244789413, now seen corresponding path program 2 times [2019-12-27 02:19:41,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:41,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298723083] [2019-12-27 02:19:41,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:41,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298723083] [2019-12-27 02:19:41,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:41,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:19:41,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392806625] [2019-12-27 02:19:41,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:19:41,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:41,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:19:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:19:41,635 INFO L87 Difference]: Start difference. First operand 20462 states and 62626 transitions. Second operand 12 states. [2019-12-27 02:19:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:43,153 INFO L93 Difference]: Finished difference Result 27267 states and 82453 transitions. [2019-12-27 02:19:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:19:43,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 02:19:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:43,196 INFO L225 Difference]: With dead ends: 27267 [2019-12-27 02:19:43,196 INFO L226 Difference]: Without dead ends: 25632 [2019-12-27 02:19:43,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-27 02:19:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25632 states. [2019-12-27 02:19:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25632 to 20627. [2019-12-27 02:19:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20627 states. [2019-12-27 02:19:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20627 states to 20627 states and 63076 transitions. [2019-12-27 02:19:43,574 INFO L78 Accepts]: Start accepts. Automaton has 20627 states and 63076 transitions. Word has length 55 [2019-12-27 02:19:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:43,575 INFO L462 AbstractCegarLoop]: Abstraction has 20627 states and 63076 transitions. [2019-12-27 02:19:43,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:19:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20627 states and 63076 transitions. [2019-12-27 02:19:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:43,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:43,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:43,607 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash -209379597, now seen corresponding path program 3 times [2019-12-27 02:19:43,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:43,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942246439] [2019-12-27 02:19:43,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:44,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942246439] [2019-12-27 02:19:44,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:44,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 02:19:44,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146119489] [2019-12-27 02:19:44,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 02:19:44,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:44,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 02:19:44,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 02:19:44,150 INFO L87 Difference]: Start difference. First operand 20627 states and 63076 transitions. Second operand 16 states. [2019-12-27 02:19:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:48,383 INFO L93 Difference]: Finished difference Result 34943 states and 106010 transitions. [2019-12-27 02:19:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 02:19:48,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 02:19:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:48,425 INFO L225 Difference]: With dead ends: 34943 [2019-12-27 02:19:48,425 INFO L226 Difference]: Without dead ends: 29637 [2019-12-27 02:19:48,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 02:19:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29637 states. [2019-12-27 02:19:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29637 to 21841. [2019-12-27 02:19:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21841 states. [2019-12-27 02:19:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21841 states to 21841 states and 66887 transitions. [2019-12-27 02:19:48,787 INFO L78 Accepts]: Start accepts. Automaton has 21841 states and 66887 transitions. Word has length 55 [2019-12-27 02:19:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:48,787 INFO L462 AbstractCegarLoop]: Abstraction has 21841 states and 66887 transitions. [2019-12-27 02:19:48,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 02:19:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 21841 states and 66887 transitions. [2019-12-27 02:19:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:48,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:48,809 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 02:19:48,809 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -157208099, now seen corresponding path program 4 times [2019-12-27 02:19:48,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:48,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632197868] [2019-12-27 02:19:48,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:49,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632197868] [2019-12-27 02:19:49,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:49,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 02:19:49,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289806507] [2019-12-27 02:19:49,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 02:19:49,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 02:19:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:19:49,383 INFO L87 Difference]: Start difference. First operand 21841 states and 66887 transitions. Second operand 20 states. [2019-12-27 02:19:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:54,383 INFO L93 Difference]: Finished difference Result 26734 states and 81421 transitions. [2019-12-27 02:19:54,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 02:19:54,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-12-27 02:19:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:54,421 INFO L225 Difference]: With dead ends: 26734 [2019-12-27 02:19:54,421 INFO L226 Difference]: Without dead ends: 25770 [2019-12-27 02:19:54,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=463, Invalid=2617, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 02:19:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25770 states. [2019-12-27 02:19:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25770 to 22013. [2019-12-27 02:19:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22013 states. [2019-12-27 02:19:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22013 states to 22013 states and 67376 transitions. [2019-12-27 02:19:54,760 INFO L78 Accepts]: Start accepts. Automaton has 22013 states and 67376 transitions. Word has length 55 [2019-12-27 02:19:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:54,761 INFO L462 AbstractCegarLoop]: Abstraction has 22013 states and 67376 transitions. [2019-12-27 02:19:54,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 02:19:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 22013 states and 67376 transitions. [2019-12-27 02:19:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:54,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:54,784 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 02:19:54,784 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:54,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1930465549, now seen corresponding path program 5 times [2019-12-27 02:19:54,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:54,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699678869] [2019-12-27 02:19:54,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:55,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699678869] [2019-12-27 02:19:55,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:55,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 02:19:55,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302573806] [2019-12-27 02:19:55,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 02:19:55,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 02:19:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:19:55,344 INFO L87 Difference]: Start difference. First operand 22013 states and 67376 transitions. Second operand 17 states. [2019-12-27 02:19:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:58,701 INFO L93 Difference]: Finished difference Result 29508 states and 89239 transitions. [2019-12-27 02:19:58,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:19:58,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 02:19:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:58,746 INFO L225 Difference]: With dead ends: 29508 [2019-12-27 02:19:58,746 INFO L226 Difference]: Without dead ends: 29199 [2019-12-27 02:19:58,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2019-12-27 02:19:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29199 states. [2019-12-27 02:19:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29199 to 21992. [2019-12-27 02:19:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21992 states. [2019-12-27 02:19:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21992 states to 21992 states and 67299 transitions. [2019-12-27 02:19:59,133 INFO L78 Accepts]: Start accepts. Automaton has 21992 states and 67299 transitions. Word has length 55 [2019-12-27 02:19:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:59,133 INFO L462 AbstractCegarLoop]: Abstraction has 21992 states and 67299 transitions. [2019-12-27 02:19:59,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 02:19:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 21992 states and 67299 transitions. [2019-12-27 02:19:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:19:59,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:59,160 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 02:19:59,161 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1786781765, now seen corresponding path program 6 times [2019-12-27 02:19:59,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:59,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148057380] [2019-12-27 02:19:59,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:59,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148057380] [2019-12-27 02:19:59,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:59,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:19:59,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605398791] [2019-12-27 02:19:59,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 02:19:59,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 02:19:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:19:59,785 INFO L87 Difference]: Start difference. First operand 21992 states and 67299 transitions. Second operand 18 states. [2019-12-27 02:20:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:03,778 INFO L93 Difference]: Finished difference Result 29485 states and 89160 transitions. [2019-12-27 02:20:03,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 02:20:03,779 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-27 02:20:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:03,819 INFO L225 Difference]: With dead ends: 29485 [2019-12-27 02:20:03,819 INFO L226 Difference]: Without dead ends: 29197 [2019-12-27 02:20:03,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 02:20:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29197 states. [2019-12-27 02:20:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29197 to 21974. [2019-12-27 02:20:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21974 states. [2019-12-27 02:20:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21974 states to 21974 states and 67248 transitions. [2019-12-27 02:20:04,226 INFO L78 Accepts]: Start accepts. Automaton has 21974 states and 67248 transitions. Word has length 55 [2019-12-27 02:20:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:04,227 INFO L462 AbstractCegarLoop]: Abstraction has 21974 states and 67248 transitions. [2019-12-27 02:20:04,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 02:20:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 21974 states and 67248 transitions. [2019-12-27 02:20:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:20:04,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:04,254 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:04,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:04,254 INFO L82 PathProgramCache]: Analyzing trace with hash 414455557, now seen corresponding path program 7 times [2019-12-27 02:20:04,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:04,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073455076] [2019-12-27 02:20:04,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:04,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073455076] [2019-12-27 02:20:04,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:04,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 02:20:04,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715323915] [2019-12-27 02:20:04,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 02:20:04,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:04,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 02:20:04,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:20:04,708 INFO L87 Difference]: Start difference. First operand 21974 states and 67248 transitions. Second operand 17 states. [2019-12-27 02:20:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:07,534 INFO L93 Difference]: Finished difference Result 29767 states and 90155 transitions. [2019-12-27 02:20:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 02:20:07,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 02:20:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:07,575 INFO L225 Difference]: With dead ends: 29767 [2019-12-27 02:20:07,575 INFO L226 Difference]: Without dead ends: 28891 [2019-12-27 02:20:07,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 02:20:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28891 states. [2019-12-27 02:20:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28891 to 21897. [2019-12-27 02:20:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21897 states. [2019-12-27 02:20:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21897 states to 21897 states and 67019 transitions. [2019-12-27 02:20:08,127 INFO L78 Accepts]: Start accepts. Automaton has 21897 states and 67019 transitions. Word has length 55 [2019-12-27 02:20:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:08,128 INFO L462 AbstractCegarLoop]: Abstraction has 21897 states and 67019 transitions. [2019-12-27 02:20:08,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 02:20:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 21897 states and 67019 transitions. [2019-12-27 02:20:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:20:08,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:08,154 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 02:20:08,154 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1269441771, now seen corresponding path program 8 times [2019-12-27 02:20:08,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:08,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856658254] [2019-12-27 02:20:08,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:08,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856658254] [2019-12-27 02:20:08,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:08,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:08,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016343391] [2019-12-27 02:20:08,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:08,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:08,201 INFO L87 Difference]: Start difference. First operand 21897 states and 67019 transitions. Second operand 3 states. [2019-12-27 02:20:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:08,306 INFO L93 Difference]: Finished difference Result 21895 states and 67014 transitions. [2019-12-27 02:20:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:08,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:20:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:08,360 INFO L225 Difference]: With dead ends: 21895 [2019-12-27 02:20:08,360 INFO L226 Difference]: Without dead ends: 21895 [2019-12-27 02:20:08,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21895 states. [2019-12-27 02:20:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21895 to 17396. [2019-12-27 02:20:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17396 states. [2019-12-27 02:20:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17396 states to 17396 states and 54226 transitions. [2019-12-27 02:20:08,911 INFO L78 Accepts]: Start accepts. Automaton has 17396 states and 54226 transitions. Word has length 55 [2019-12-27 02:20:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:08,911 INFO L462 AbstractCegarLoop]: Abstraction has 17396 states and 54226 transitions. [2019-12-27 02:20:08,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17396 states and 54226 transitions. [2019-12-27 02:20:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:20:08,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:08,940 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 02:20:08,940 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1211542094, now seen corresponding path program 1 times [2019-12-27 02:20:08,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:08,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258992157] [2019-12-27 02:20:08,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:09,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258992157] [2019-12-27 02:20:09,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:09,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 02:20:09,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697937948] [2019-12-27 02:20:09,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 02:20:09,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:09,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 02:20:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-27 02:20:09,498 INFO L87 Difference]: Start difference. First operand 17396 states and 54226 transitions. Second operand 16 states. [2019-12-27 02:20:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:13,448 INFO L93 Difference]: Finished difference Result 27725 states and 84321 transitions. [2019-12-27 02:20:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 02:20:13,451 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 02:20:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:13,489 INFO L225 Difference]: With dead ends: 27725 [2019-12-27 02:20:13,489 INFO L226 Difference]: Without dead ends: 25396 [2019-12-27 02:20:13,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=322, Invalid=1484, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 02:20:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25396 states. [2019-12-27 02:20:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25396 to 17731. [2019-12-27 02:20:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17731 states. [2019-12-27 02:20:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17731 states to 17731 states and 55062 transitions. [2019-12-27 02:20:13,966 INFO L78 Accepts]: Start accepts. Automaton has 17731 states and 55062 transitions. Word has length 56 [2019-12-27 02:20:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:13,966 INFO L462 AbstractCegarLoop]: Abstraction has 17731 states and 55062 transitions. [2019-12-27 02:20:13,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 02:20:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17731 states and 55062 transitions. [2019-12-27 02:20:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:20:13,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:13,987 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 02:20:13,987 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1521838778, now seen corresponding path program 2 times [2019-12-27 02:20:13,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:13,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416610016] [2019-12-27 02:20:13,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:14,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416610016] [2019-12-27 02:20:14,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:14,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:20:14,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316154761] [2019-12-27 02:20:14,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:20:14,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:20:14,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:20:14,189 INFO L87 Difference]: Start difference. First operand 17731 states and 55062 transitions. Second operand 10 states. [2019-12-27 02:20:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:15,722 INFO L93 Difference]: Finished difference Result 25424 states and 77452 transitions. [2019-12-27 02:20:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:20:15,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-27 02:20:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:15,757 INFO L225 Difference]: With dead ends: 25424 [2019-12-27 02:20:15,757 INFO L226 Difference]: Without dead ends: 24215 [2019-12-27 02:20:15,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:20:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24215 states. [2019-12-27 02:20:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24215 to 18443. [2019-12-27 02:20:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18443 states. [2019-12-27 02:20:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18443 states to 18443 states and 57001 transitions. [2019-12-27 02:20:16,067 INFO L78 Accepts]: Start accepts. Automaton has 18443 states and 57001 transitions. Word has length 56 [2019-12-27 02:20:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:16,067 INFO L462 AbstractCegarLoop]: Abstraction has 18443 states and 57001 transitions. [2019-12-27 02:20:16,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:20:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 57001 transitions. [2019-12-27 02:20:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:20:16,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:16,088 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 02:20:16,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1112243484, now seen corresponding path program 3 times [2019-12-27 02:20:16,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:16,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885524943] [2019-12-27 02:20:16,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:16,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885524943] [2019-12-27 02:20:16,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:16,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:20:16,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975461253] [2019-12-27 02:20:16,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:20:16,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:20:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:20:16,308 INFO L87 Difference]: Start difference. First operand 18443 states and 57001 transitions. Second operand 11 states. [2019-12-27 02:20:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:17,857 INFO L93 Difference]: Finished difference Result 24702 states and 75223 transitions. [2019-12-27 02:20:17,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:20:17,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 02:20:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:17,891 INFO L225 Difference]: With dead ends: 24702 [2019-12-27 02:20:17,891 INFO L226 Difference]: Without dead ends: 23776 [2019-12-27 02:20:17,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:20:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23776 states. [2019-12-27 02:20:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23776 to 18466. [2019-12-27 02:20:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18466 states. [2019-12-27 02:20:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18466 states to 18466 states and 57113 transitions. [2019-12-27 02:20:18,364 INFO L78 Accepts]: Start accepts. Automaton has 18466 states and 57113 transitions. Word has length 56 [2019-12-27 02:20:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:18,364 INFO L462 AbstractCegarLoop]: Abstraction has 18466 states and 57113 transitions. [2019-12-27 02:20:18,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:20:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 18466 states and 57113 transitions. [2019-12-27 02:20:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:20:18,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:18,385 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 02:20:18,385 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:18,386 INFO L82 PathProgramCache]: Analyzing trace with hash -445147212, now seen corresponding path program 4 times [2019-12-27 02:20:18,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:18,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354876032] [2019-12-27 02:20:18,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:18,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354876032] [2019-12-27 02:20:18,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:18,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:20:18,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873604966] [2019-12-27 02:20:18,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:20:18,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:20:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:20:18,630 INFO L87 Difference]: Start difference. First operand 18466 states and 57113 transitions. Second operand 12 states. [2019-12-27 02:20:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:20,176 INFO L93 Difference]: Finished difference Result 24455 states and 74720 transitions. [2019-12-27 02:20:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:20:20,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 02:20:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:20,209 INFO L225 Difference]: With dead ends: 24455 [2019-12-27 02:20:20,209 INFO L226 Difference]: Without dead ends: 23094 [2019-12-27 02:20:20,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 02:20:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23094 states. [2019-12-27 02:20:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23094 to 17268. [2019-12-27 02:20:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17268 states. [2019-12-27 02:20:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17268 states to 17268 states and 53788 transitions. [2019-12-27 02:20:20,504 INFO L78 Accepts]: Start accepts. Automaton has 17268 states and 53788 transitions. Word has length 56 [2019-12-27 02:20:20,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:20,504 INFO L462 AbstractCegarLoop]: Abstraction has 17268 states and 53788 transitions. [2019-12-27 02:20:20,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:20:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17268 states and 53788 transitions. [2019-12-27 02:20:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:20:20,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:20,524 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 02:20:20,524 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1886942222, now seen corresponding path program 5 times [2019-12-27 02:20:20,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:20,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928303399] [2019-12-27 02:20:20,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:20,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928303399] [2019-12-27 02:20:20,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:20,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:20:20,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745929213] [2019-12-27 02:20:20,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 02:20:20,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:20,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 02:20:20,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:20:20,826 INFO L87 Difference]: Start difference. First operand 17268 states and 53788 transitions. Second operand 14 states. [2019-12-27 02:20:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:22,813 INFO L93 Difference]: Finished difference Result 22570 states and 69050 transitions. [2019-12-27 02:20:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 02:20:22,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 02:20:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:22,845 INFO L225 Difference]: With dead ends: 22570 [2019-12-27 02:20:22,845 INFO L226 Difference]: Without dead ends: 21380 [2019-12-27 02:20:22,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 02:20:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21380 states. [2019-12-27 02:20:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21380 to 16973. [2019-12-27 02:20:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16973 states. [2019-12-27 02:20:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16973 states to 16973 states and 52825 transitions. [2019-12-27 02:20:23,271 INFO L78 Accepts]: Start accepts. Automaton has 16973 states and 52825 transitions. Word has length 56 [2019-12-27 02:20:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:23,271 INFO L462 AbstractCegarLoop]: Abstraction has 16973 states and 52825 transitions. [2019-12-27 02:20:23,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 02:20:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 16973 states and 52825 transitions. [2019-12-27 02:20:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:20:23,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:23,289 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 02:20:23,289 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1655686983, now seen corresponding path program 1 times [2019-12-27 02:20:23,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:23,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774297287] [2019-12-27 02:20:23,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:23,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774297287] [2019-12-27 02:20:23,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:23,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:23,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178449537] [2019-12-27 02:20:23,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:23,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:23,343 INFO L87 Difference]: Start difference. First operand 16973 states and 52825 transitions. Second operand 3 states. [2019-12-27 02:20:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:23,435 INFO L93 Difference]: Finished difference Result 17971 states and 53730 transitions. [2019-12-27 02:20:23,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:23,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 02:20:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:23,470 INFO L225 Difference]: With dead ends: 17971 [2019-12-27 02:20:23,470 INFO L226 Difference]: Without dead ends: 17971 [2019-12-27 02:20:23,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17971 states. [2019-12-27 02:20:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17971 to 16963. [2019-12-27 02:20:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16963 states. [2019-12-27 02:20:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16963 states to 16963 states and 50810 transitions. [2019-12-27 02:20:23,746 INFO L78 Accepts]: Start accepts. Automaton has 16963 states and 50810 transitions. Word has length 56 [2019-12-27 02:20:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:23,746 INFO L462 AbstractCegarLoop]: Abstraction has 16963 states and 50810 transitions. [2019-12-27 02:20:23,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 16963 states and 50810 transitions. [2019-12-27 02:20:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:20:23,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:23,764 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 02:20:23,764 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash -196673722, now seen corresponding path program 6 times [2019-12-27 02:20:23,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:23,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226756211] [2019-12-27 02:20:23,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:20:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:20:23,862 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:20:23,863 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:20:23,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= v_~z~0_13 0) (= v_~__unbuffered_cnt~0_148 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff0_thd1~0_322 0) (= 0 v_~x$r_buff0_thd2~0_247) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21| 1)) (= v_~x$flush_delayed~0_68 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t916~0.base_21| 4)) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21|) |v_ULTIMATE.start_main_~#t916~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t916~0.base_21|) (= v_~x$r_buff1_thd1~0_293 0) (= v_~x$r_buff0_thd0~0_140 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21|) 0) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$w_buff0~0_441) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~x~0_192) (= v_~main$tmp_guard0~0_20 0) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= 0 |v_ULTIMATE.start_main_~#t916~0.offset_16|) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX~0_150 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_964) (= v_~x$r_buff1_thd0~0_215 0) (= v_~x$mem_tmp~0_38 0) (= v_~a~0_41 0) (= 0 v_~x$r_buff0_thd3~0_132))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_441, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_293, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_270|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~a~0=v_~a~0_41, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t916~0.offset=|v_ULTIMATE.start_main_~#t916~0.offset_16|, ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_35, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~x~0=v_~x~0_192, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_72|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y~0=v_~y~0_44, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_964, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_155, ULTIMATE.start_main_~#t916~0.base=|v_ULTIMATE.start_main_~#t916~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t916~0.offset, ULTIMATE.start_main_~#t917~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t918~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t917~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t916~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 02:20:23,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= |v_ULTIMATE.start_main_~#t917~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13|) |v_ULTIMATE.start_main_~#t917~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t917~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t917~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t917~0.offset, ULTIMATE.start_main_~#t917~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 02:20:23,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t918~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t918~0.base_13|) (= |v_ULTIMATE.start_main_~#t918~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t918~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13|) |v_ULTIMATE.start_main_~#t918~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_13|, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_~#t918~0.offset] because there is no mapped edge [2019-12-27 02:20:23,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0~0_19) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= v_~x$w_buff1_used~0_44 v_~x$w_buff0_used~0_74) (= 1 v_~x$w_buff0_used~0_73) (= 0 (mod v_~x$w_buff1_used~0_44 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 02:20:23,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In887683725 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In887683725 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out887683725| ~x~0_In887683725)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out887683725| ~x$w_buff1~0_In887683725) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In887683725, ~x$w_buff1_used~0=~x$w_buff1_used~0_In887683725, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In887683725, ~x~0=~x~0_In887683725} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out887683725|, ~x$w_buff1~0=~x$w_buff1~0_In887683725, ~x$w_buff1_used~0=~x$w_buff1_used~0_In887683725, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In887683725, ~x~0=~x~0_In887683725} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 02:20:23,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In121923273 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In121923273 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out121923273|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out121923273| ~x$w_buff0_used~0_In121923273)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In121923273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In121923273} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In121923273, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out121923273|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In121923273} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 02:20:23,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= v_~x~0_35 |v_P2Thread1of1ForFork2_#t~ite32_12|) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_12|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_17|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-27 02:20:23,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1506258329 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1506258329 256)))) (or (and (= ~x$w_buff0_used~0_In-1506258329 |P2Thread1of1ForFork2_#t~ite34_Out-1506258329|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-1506258329|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1506258329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1506258329} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1506258329|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1506258329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1506258329} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 02:20:23,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1302035246 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1302035246 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1302035246 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1302035246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out1302035246|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1302035246 |P2Thread1of1ForFork2_#t~ite35_Out1302035246|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1302035246, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1302035246, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1302035246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1302035246} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1302035246|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1302035246, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1302035246, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1302035246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1302035246} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 02:20:23,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1365433789 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1365433789 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1365433789 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1365433789 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out1365433789|)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out1365433789| ~x$w_buff1_used~0_In1365433789) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1365433789, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1365433789, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1365433789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1365433789} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1365433789|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1365433789, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1365433789, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1365433789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1365433789} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 02:20:23,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2016020199 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2016020199 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-2016020199 ~x$r_buff0_thd2~0_In-2016020199) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd2~0_Out-2016020199 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2016020199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2016020199} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2016020199|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2016020199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2016020199} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 02:20:23,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1316274810 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1316274810 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1316274810 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1316274810 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out1316274810|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In1316274810 |P1Thread1of1ForFork1_#t~ite31_Out1316274810|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1316274810, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1316274810, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1316274810, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1316274810} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1316274810|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1316274810, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1316274810, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1316274810, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1316274810} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:20:23,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_113 |v_P1Thread1of1ForFork1_#t~ite31_42|)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_41|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:20:23,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In795765816 256)))) (or (and (= ~x$w_buff1~0_In795765816 |P0Thread1of1ForFork0_#t~ite12_Out795765816|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In795765816| |P0Thread1of1ForFork0_#t~ite11_Out795765816|)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In795765816 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In795765816 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In795765816 256)) .cse1) (= (mod ~x$w_buff0_used~0_In795765816 256) 0))) (= |P0Thread1of1ForFork0_#t~ite12_Out795765816| |P0Thread1of1ForFork0_#t~ite11_Out795765816|) (= ~x$w_buff1~0_In795765816 |P0Thread1of1ForFork0_#t~ite11_Out795765816|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In795765816|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In795765816, ~x$w_buff1~0=~x$w_buff1~0_In795765816, ~x$w_buff1_used~0=~x$w_buff1_used~0_In795765816, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In795765816, ~weak$$choice2~0=~weak$$choice2~0_In795765816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In795765816} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out795765816|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In795765816, ~x$w_buff1~0=~x$w_buff1~0_In795765816, ~x$w_buff1_used~0=~x$w_buff1_used~0_In795765816, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In795765816, ~weak$$choice2~0=~weak$$choice2~0_In795765816, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out795765816|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In795765816} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:20:23,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1200886190 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite15_Out-1200886190| |P0Thread1of1ForFork0_#t~ite14_Out-1200886190|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1200886190 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1200886190 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1200886190 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1200886190 256)))) (= ~x$w_buff0_used~0_In-1200886190 |P0Thread1of1ForFork0_#t~ite14_Out-1200886190|)) (and (= ~x$w_buff0_used~0_In-1200886190 |P0Thread1of1ForFork0_#t~ite15_Out-1200886190|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite14_In-1200886190| |P0Thread1of1ForFork0_#t~ite14_Out-1200886190|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1200886190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200886190, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1200886190, ~weak$$choice2~0=~weak$$choice2~0_In-1200886190, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-1200886190|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200886190} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1200886190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200886190, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1200886190, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-1200886190|, ~weak$$choice2~0=~weak$$choice2~0_In-1200886190, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-1200886190|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200886190} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 02:20:23,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_65 v_~x$r_buff0_thd1~0_64) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_64, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 02:20:23,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= v_~x$flush_delayed~0_20 0) (= v_~x~0_54 v_~x$mem_tmp~0_15) (not (= (mod v_~x$flush_delayed~0_21 256) 0)) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 02:20:23,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-497726159 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-497726159 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-497726159|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-497726159 |P2Thread1of1ForFork2_#t~ite36_Out-497726159|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-497726159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497726159} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-497726159|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-497726159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497726159} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 02:20:23,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1017182308 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1017182308 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-1017182308 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1017182308 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite37_Out-1017182308| ~x$r_buff1_thd3~0_In-1017182308) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite37_Out-1017182308| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1017182308, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1017182308, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1017182308, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1017182308} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1017182308|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1017182308, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1017182308, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1017182308, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1017182308} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 02:20:23,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_46| v_~x$r_buff1_thd3~0_117)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_45|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:20:23,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:20:23,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2118281877 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2118281877 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-2118281877 |ULTIMATE.start_main_#t~ite41_Out-2118281877|)) (and (= ~x$w_buff1~0_In-2118281877 |ULTIMATE.start_main_#t~ite41_Out-2118281877|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2118281877, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2118281877, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2118281877, ~x~0=~x~0_In-2118281877} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2118281877|, ~x$w_buff1~0=~x$w_buff1~0_In-2118281877, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2118281877, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2118281877, ~x~0=~x~0_In-2118281877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:20:23,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 02:20:23,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-71042983 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-71042983 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-71042983| ~x$w_buff0_used~0_In-71042983) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-71042983|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-71042983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-71042983} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-71042983, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-71042983|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-71042983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:20:23,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In465962309 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In465962309 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In465962309 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In465962309 256) 0))) (or (and (= ~x$w_buff1_used~0_In465962309 |ULTIMATE.start_main_#t~ite44_Out465962309|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite44_Out465962309|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In465962309, ~x$w_buff1_used~0=~x$w_buff1_used~0_In465962309, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In465962309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465962309} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In465962309, ~x$w_buff1_used~0=~x$w_buff1_used~0_In465962309, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In465962309, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out465962309|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465962309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:20:23,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1621958739 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1621958739 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1621958739| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1621958739| ~x$r_buff0_thd0~0_In-1621958739)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1621958739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621958739} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1621958739, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1621958739|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621958739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:20:23,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1843791854 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1843791854 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1843791854 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1843791854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1843791854| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out1843791854| ~x$r_buff1_thd0~0_In1843791854) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1843791854, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1843791854, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1843791854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1843791854} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1843791854, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1843791854|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1843791854, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1843791854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1843791854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 02:20:23,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p1_EAX~0_139 0) (= v_~x$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite46_54|) (= v_~main$tmp_guard1~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 02:20:23,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:20:23 BasicIcfg [2019-12-27 02:20:23,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:20:23,988 INFO L168 Benchmark]: Toolchain (without parser) took 93851.32 ms. Allocated memory was 146.3 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 101.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 02:20:23,989 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:20:23,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.87 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 156.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:23,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:23,993 INFO L168 Benchmark]: Boogie Preprocessor took 57.12 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:23,994 INFO L168 Benchmark]: RCFGBuilder took 801.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 104.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:23,994 INFO L168 Benchmark]: TraceAbstraction took 92083.36 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 02:20:24,001 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.53 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.87 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 156.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.12 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 104.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92083.36 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6463 VarBasedMoverChecksPositive, 266 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66821 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, z=0] [L779] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 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) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 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 [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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 [L743] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 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) [L744] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 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)) [L745] 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)) [L746] 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)) [L747] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 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)) [L749] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 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)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 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 [L841] 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, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 91.7s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 44.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5097 SDtfs, 7227 SDslu, 23689 SDs, 0 SdLazy, 31031 SolverSat, 419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 105 SyntacticMatches, 22 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2927 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89098occurred 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: 22.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 129392 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1153 NumberOfCodeBlocks, 1153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 335109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...