/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/safe033_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:11:43,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:11:43,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:11:43,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:11:43,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:11:43,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:11:43,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:11:43,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:11:43,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:11:43,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:11:43,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:11:43,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:11:43,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:11:43,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:11:43,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:11:43,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:11:43,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:11:43,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:11:43,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:11:43,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:11:43,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:11:43,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:11:43,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:11:43,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:11:43,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:11:43,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:11:43,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:11:43,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:11:43,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:11:43,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:11:43,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:11:43,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:11:43,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:11:43,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:11:43,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:11:43,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:11:43,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:11:43,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:11:43,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:11:43,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:11:43,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:11:43,940 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 04:11:43,970 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:11:43,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:11:43,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:11:43,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:11:43,972 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:11:43,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:11:43,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:11:43,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:11:43,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:11:43,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:11:43,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:11:43,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:11:43,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:11:43,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:11:43,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:11:43,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:11:43,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:11:43,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:11:43,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:11:43,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:11:43,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:11:43,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:11:43,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:11:43,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:11:43,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:11:43,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:11:43,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:11:43,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:11:43,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:11:44,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:11:44,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:11:44,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:11:44,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:11:44,269 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:11:44,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i [2019-12-27 04:11:44,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097eb43c2/d06e983165f24fa59881e86bcb9fe54c/FLAG1ebeaa5dd [2019-12-27 04:11:44,922 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:11:44,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i [2019-12-27 04:11:44,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097eb43c2/d06e983165f24fa59881e86bcb9fe54c/FLAG1ebeaa5dd [2019-12-27 04:11:45,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097eb43c2/d06e983165f24fa59881e86bcb9fe54c [2019-12-27 04:11:45,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:11:45,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:11:45,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:11:45,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:11:45,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:11:45,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:45,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45, skipping insertion in model container [2019-12-27 04:11:45,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:45,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:11:45,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:11:45,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:11:45,800 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:11:45,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:11:45,970 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:11:45,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45 WrapperNode [2019-12-27 04:11:45,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:11:45,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:11:45,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:11:45,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:11:45,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 04:11:45" (1/1) ... [2019-12-27 04:11:46,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:11:46,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:11:46,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:11:46,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:11:46,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (1/1) ... [2019-12-27 04:11:46,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:11:46,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:11:46,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:11:46,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:11:46,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (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 04:11:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:11:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:11:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:11:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:11:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:11:46,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:11:46,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:11:46,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:11:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:11:46,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:11:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:11:46,148 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 04:11:46,835 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:11:46,835 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:11:46,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:11:46 BoogieIcfgContainer [2019-12-27 04:11:46,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:11:46,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:11:46,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:11:46,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:11:46,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:11:45" (1/3) ... [2019-12-27 04:11:46,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b81aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:11:46, skipping insertion in model container [2019-12-27 04:11:46,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:45" (2/3) ... [2019-12-27 04:11:46,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b81aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:11:46, skipping insertion in model container [2019-12-27 04:11:46,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:11:46" (3/3) ... [2019-12-27 04:11:46,850 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.opt.i [2019-12-27 04:11:46,861 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:11:46,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:11:46,869 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:11:46,870 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:11:46,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,907 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,907 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,932 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,932 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,932 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,933 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:11:46,972 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 04:11:46,993 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:11:46,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:11:46,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:11:46,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:11:46,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:11:46,994 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:11:46,994 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:11:46,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:11:47,010 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 04:11:47,011 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 04:11:47,109 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 04:11:47,110 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:11:47,126 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 04:11:47,140 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 04:11:47,216 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 04:11:47,216 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:11:47,223 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 04:11:47,238 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 04:11:47,239 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:11:52,247 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 04:11:52,352 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 04:11:52,495 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-27 04:11:52,495 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 04:11:52,499 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-27 04:11:52,866 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-27 04:11:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-27 04:11:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:11:52,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:52,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:11:52,876 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-27 04:11:52,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:52,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770155158] [2019-12-27 04:11:52,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:53,124 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 04:11:53,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770155158] [2019-12-27 04:11:53,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:53,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:11:53,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288720310] [2019-12-27 04:11:53,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:53,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:53,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:53,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:53,155 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-27 04:11:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:53,417 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 04:11:53,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:53,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:11:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:53,492 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 04:11:53,492 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 04:11:53,494 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 04:11:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 04:11:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 04:11:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 04:11:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 04:11:53,837 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 04:11:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:53,837 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 04:11:53,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 04:11:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:11:53,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:53,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:11:53,848 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:53,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-27 04:11:53,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:53,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899927293] [2019-12-27 04:11:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:53,938 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 04:11:53,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899927293] [2019-12-27 04:11:53,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:53,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:53,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436689063] [2019-12-27 04:11:53,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:53,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:53,942 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 04:11:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:53,974 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 04:11:53,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:53,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 04:11:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:53,981 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 04:11:53,982 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 04:11:53,983 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 04:11:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 04:11:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 04:11:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 04:11:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 04:11:54,013 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 04:11:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:54,013 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 04:11:54,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 04:11:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:11:54,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:54,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:11:54,016 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-27 04:11:54,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:54,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768166458] [2019-12-27 04:11:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:54,099 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 04:11:54,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768166458] [2019-12-27 04:11:54,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:54,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:11:54,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386224545] [2019-12-27 04:11:54,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:54,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:54,102 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-12-27 04:11:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:54,186 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 04:11:54,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:54,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 04:11:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:54,197 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 04:11:54,197 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 04:11:54,198 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 04:11:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 04:11:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 04:11:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 04:11:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 04:11:54,299 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 04:11:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:54,299 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 04:11:54,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 04:11:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:11:54,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:54,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:11:54,305 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-27 04:11:54,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:54,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778327949] [2019-12-27 04:11:54,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:11:54,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778327949] [2019-12-27 04:11:54,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:54,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:54,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719337643] [2019-12-27 04:11:54,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:11:54,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:54,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:11:54,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:11:54,383 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-12-27 04:11:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:54,557 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 04:11:54,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:11:54,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 04:11:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:54,567 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 04:11:54,568 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 04:11:54,568 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 04:11:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 04:11:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 04:11:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 04:11:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 04:11:54,608 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 04:11:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:54,609 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 04:11:54,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:11:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 04:11:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:11:54,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:54,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:11:54,610 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-27 04:11:54,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:54,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369189313] [2019-12-27 04:11:54,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:54,712 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 04:11:54,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369189313] [2019-12-27 04:11:54,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:54,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:54,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919825094] [2019-12-27 04:11:54,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:11:54,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:54,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:11:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:11:54,718 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-12-27 04:11:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:54,880 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 04:11:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:11:54,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 04:11:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:54,892 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 04:11:54,892 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 04:11:54,893 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 04:11:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 04:11:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 04:11:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 04:11:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 04:11:54,931 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 04:11:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:54,932 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 04:11:54,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:11:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 04:11:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:11:54,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:54,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:11:54,935 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-27 04:11:54,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:54,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136516135] [2019-12-27 04:11:54,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:54,982 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 04:11:54,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136516135] [2019-12-27 04:11:54,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:54,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:11:54,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038677508] [2019-12-27 04:11:54,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:11:54,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:11:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:11:54,984 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-12-27 04:11:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:55,003 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 04:11:55,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:11:55,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 04:11:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:55,008 INFO L225 Difference]: With dead ends: 772 [2019-12-27 04:11:55,009 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 04:11:55,009 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 04:11:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 04:11:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 04:11:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 04:11:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 04:11:55,024 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 04:11:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:55,024 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 04:11:55,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:11:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 04:11:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:11:55,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:55,027 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] [2019-12-27 04:11:55,027 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash -635782706, now seen corresponding path program 1 times [2019-12-27 04:11:55,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:55,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470459695] [2019-12-27 04:11:55,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:11:55,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470459695] [2019-12-27 04:11:55,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:55,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:55,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273304753] [2019-12-27 04:11:55,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:55,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:55,107 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 3 states. [2019-12-27 04:11:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:55,119 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 04:11:55,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:55,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 04:11:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:55,122 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 04:11:55,122 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 04:11:55,123 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 04:11:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 04:11:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 04:11:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 04:11:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 04:11:55,133 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 04:11:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:55,133 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 04:11:55,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 04:11:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:11:55,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:55,137 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] [2019-12-27 04:11:55,138 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash 822694706, now seen corresponding path program 2 times [2019-12-27 04:11:55,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:55,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762421251] [2019-12-27 04:11:55,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:55,264 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 04:11:55,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762421251] [2019-12-27 04:11:55,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:55,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:11:55,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955935375] [2019-12-27 04:11:55,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:11:55,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:11:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:11:55,266 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 6 states. [2019-12-27 04:11:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:55,423 INFO L93 Difference]: Finished difference Result 797 states and 1782 transitions. [2019-12-27 04:11:55,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:11:55,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 04:11:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:55,433 INFO L225 Difference]: With dead ends: 797 [2019-12-27 04:11:55,433 INFO L226 Difference]: Without dead ends: 535 [2019-12-27 04:11:55,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:11:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-27 04:11:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 461. [2019-12-27 04:11:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 04:11:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1034 transitions. [2019-12-27 04:11:55,444 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1034 transitions. Word has length 41 [2019-12-27 04:11:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:55,447 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1034 transitions. [2019-12-27 04:11:55,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:11:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1034 transitions. [2019-12-27 04:11:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:11:55,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:55,449 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] [2019-12-27 04:11:55,449 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1004168232, now seen corresponding path program 3 times [2019-12-27 04:11:55,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:55,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592146137] [2019-12-27 04:11:55,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:55,611 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 04:11:55,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592146137] [2019-12-27 04:11:55,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:55,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:11:55,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991855246] [2019-12-27 04:11:55,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:11:55,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:55,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:11:55,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:11:55,613 INFO L87 Difference]: Start difference. First operand 461 states and 1034 transitions. Second operand 7 states. [2019-12-27 04:11:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:56,012 INFO L93 Difference]: Finished difference Result 705 states and 1447 transitions. [2019-12-27 04:11:56,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:11:56,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 04:11:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:56,017 INFO L225 Difference]: With dead ends: 705 [2019-12-27 04:11:56,017 INFO L226 Difference]: Without dead ends: 705 [2019-12-27 04:11:56,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:11:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-27 04:11:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 582. [2019-12-27 04:11:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-27 04:11:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1226 transitions. [2019-12-27 04:11:56,031 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1226 transitions. Word has length 41 [2019-12-27 04:11:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:56,032 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1226 transitions. [2019-12-27 04:11:56,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:11:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1226 transitions. [2019-12-27 04:11:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:11:56,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:56,034 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] [2019-12-27 04:11:56,034 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2141087868, now seen corresponding path program 1 times [2019-12-27 04:11:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:56,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20164300] [2019-12-27 04:11:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:56,068 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 04:11:56,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20164300] [2019-12-27 04:11:56,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:56,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:11:56,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069485410] [2019-12-27 04:11:56,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:56,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:56,071 INFO L87 Difference]: Start difference. First operand 582 states and 1226 transitions. Second operand 3 states. [2019-12-27 04:11:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:56,112 INFO L93 Difference]: Finished difference Result 653 states and 1281 transitions. [2019-12-27 04:11:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:56,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 04:11:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:56,116 INFO L225 Difference]: With dead ends: 653 [2019-12-27 04:11:56,116 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 04:11:56,117 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 04:11:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 04:11:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 575. [2019-12-27 04:11:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 04:11:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1142 transitions. [2019-12-27 04:11:56,128 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1142 transitions. Word has length 41 [2019-12-27 04:11:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:56,128 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1142 transitions. [2019-12-27 04:11:56,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1142 transitions. [2019-12-27 04:11:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:11:56,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:56,130 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] [2019-12-27 04:11:56,130 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash 910051156, now seen corresponding path program 4 times [2019-12-27 04:11:56,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:56,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438231441] [2019-12-27 04:11:56,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:56,244 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 04:11:56,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438231441] [2019-12-27 04:11:56,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:56,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:11:56,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952179849] [2019-12-27 04:11:56,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:11:56,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:11:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:11:56,248 INFO L87 Difference]: Start difference. First operand 575 states and 1142 transitions. Second operand 9 states. [2019-12-27 04:11:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:56,954 INFO L93 Difference]: Finished difference Result 1278 states and 2500 transitions. [2019-12-27 04:11:56,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:11:56,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 04:11:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:56,962 INFO L225 Difference]: With dead ends: 1278 [2019-12-27 04:11:56,963 INFO L226 Difference]: Without dead ends: 1042 [2019-12-27 04:11:56,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:11:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-12-27 04:11:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 575. [2019-12-27 04:11:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 04:11:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1135 transitions. [2019-12-27 04:11:56,978 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1135 transitions. Word has length 41 [2019-12-27 04:11:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:56,979 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1135 transitions. [2019-12-27 04:11:56,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:11:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1135 transitions. [2019-12-27 04:11:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:11:56,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:56,981 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] [2019-12-27 04:11:56,981 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash -20717114, now seen corresponding path program 5 times [2019-12-27 04:11:56,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:56,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008872390] [2019-12-27 04:11:56,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:57,067 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 04:11:57,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008872390] [2019-12-27 04:11:57,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:57,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:11:57,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036458901] [2019-12-27 04:11:57,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:11:57,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:11:57,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:11:57,069 INFO L87 Difference]: Start difference. First operand 575 states and 1135 transitions. Second operand 6 states. [2019-12-27 04:11:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:57,466 INFO L93 Difference]: Finished difference Result 822 states and 1604 transitions. [2019-12-27 04:11:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:11:57,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 04:11:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:57,472 INFO L225 Difference]: With dead ends: 822 [2019-12-27 04:11:57,472 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 04:11:57,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:11:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 04:11:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 599. [2019-12-27 04:11:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 04:11:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1188 transitions. [2019-12-27 04:11:57,489 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1188 transitions. Word has length 41 [2019-12-27 04:11:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:57,489 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1188 transitions. [2019-12-27 04:11:57,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:11:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1188 transitions. [2019-12-27 04:11:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:11:57,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:57,491 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] [2019-12-27 04:11:57,492 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:57,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1415185578, now seen corresponding path program 6 times [2019-12-27 04:11:57,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:57,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104108669] [2019-12-27 04:11:57,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:57,596 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 04:11:57,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104108669] [2019-12-27 04:11:57,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:57,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:57,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431585239] [2019-12-27 04:11:57,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:57,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:57,598 INFO L87 Difference]: Start difference. First operand 599 states and 1188 transitions. Second operand 3 states. [2019-12-27 04:11:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:57,610 INFO L93 Difference]: Finished difference Result 599 states and 1186 transitions. [2019-12-27 04:11:57,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:57,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 04:11:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:57,613 INFO L225 Difference]: With dead ends: 599 [2019-12-27 04:11:57,613 INFO L226 Difference]: Without dead ends: 599 [2019-12-27 04:11:57,619 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 04:11:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-27 04:11:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 507. [2019-12-27 04:11:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-27 04:11:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1013 transitions. [2019-12-27 04:11:57,632 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1013 transitions. Word has length 41 [2019-12-27 04:11:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:57,633 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1013 transitions. [2019-12-27 04:11:57,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1013 transitions. [2019-12-27 04:11:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:11:57,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:57,635 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] [2019-12-27 04:11:57,635 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 1 times [2019-12-27 04:11:57,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:57,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147876639] [2019-12-27 04:11:57,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:11:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:11:57,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:11:57,789 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:11:57,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2563~0.base_24| 4) |v_#length_15|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24| 1)) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24|) 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2563~0.base=|v_ULTIMATE.start_main_~#t2563~0.base_24|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2563~0.offset=|v_ULTIMATE.start_main_~#t2563~0.offset_18|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_25|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2563~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2564~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2563~0.offset, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2564~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 04:11:57,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11|) |v_ULTIMATE.start_main_~#t2564~0.offset_9| 1)) |v_#memory_int_5|) (not (= |v_ULTIMATE.start_main_~#t2564~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t2564~0.offset_9|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2564~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2564~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_11|, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2564~0.base, ULTIMATE.start_main_~#t2564~0.offset] because there is no mapped edge [2019-12-27 04:11:57,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22 0)) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 04:11:57,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1110822667 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In1110822667| |P0Thread1of1ForFork1_#t~ite8_Out1110822667|) (= |P0Thread1of1ForFork1_#t~ite9_Out1110822667| ~x$w_buff0~0_In1110822667)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1110822667 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1110822667 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1110822667 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In1110822667 256)) .cse1))) (= |P0Thread1of1ForFork1_#t~ite9_Out1110822667| |P0Thread1of1ForFork1_#t~ite8_Out1110822667|) .cse0 (= ~x$w_buff0~0_In1110822667 |P0Thread1of1ForFork1_#t~ite8_Out1110822667|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1110822667, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1110822667, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In1110822667|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1110822667, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1110822667, ~weak$$choice2~0=~weak$$choice2~0_In1110822667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1110822667} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1110822667, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1110822667, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1110822667|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out1110822667|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1110822667, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1110822667, ~weak$$choice2~0=~weak$$choice2~0_In1110822667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1110822667} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 04:11:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_16|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 04:11:57,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 04:11:57,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1214474753 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1214474753 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1214474753| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1214474753| ~x$w_buff0_used~0_In-1214474753)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1214474753, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214474753} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1214474753, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1214474753|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214474753} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 04:11:57,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1764906808 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1764906808 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1764906808 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1764906808 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1764906808| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-1764906808| ~x$w_buff1_used~0_In-1764906808) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1764906808, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1764906808, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1764906808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1764906808} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1764906808, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1764906808, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1764906808, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1764906808|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1764906808} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 04:11:57,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1694335324 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1694335324 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1694335324) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1694335324 ~x$r_buff0_thd2~0_Out1694335324)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1694335324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1694335324} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1694335324|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1694335324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1694335324} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 04:11:57,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-557766684 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-557766684 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-557766684 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-557766684 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-557766684| ~x$r_buff1_thd2~0_In-557766684)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out-557766684| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-557766684, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-557766684, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-557766684, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-557766684} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-557766684|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557766684, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-557766684, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-557766684, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-557766684} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 04:11:57,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 04:11:57,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 04:11:57,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2026748184 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite35_Out-2026748184| |ULTIMATE.start_main_#t~ite34_Out-2026748184|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2026748184 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-2026748184 |ULTIMATE.start_main_#t~ite34_Out-2026748184|)) (and (not .cse2) .cse0 (= ~x$w_buff1~0_In-2026748184 |ULTIMATE.start_main_#t~ite34_Out-2026748184|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2026748184, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2026748184, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2026748184, ~x~0=~x~0_In-2026748184} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2026748184, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2026748184|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2026748184, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2026748184, ~x~0=~x~0_In-2026748184, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2026748184|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 04:11:57,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1278125382 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1278125382 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1278125382| 0)) (and (= |ULTIMATE.start_main_#t~ite36_Out1278125382| ~x$w_buff0_used~0_In1278125382) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1278125382, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278125382} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1278125382, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1278125382|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278125382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 04:11:57,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1987856085 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1987856085 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1987856085 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1987856085 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1987856085 |ULTIMATE.start_main_#t~ite37_Out1987856085|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1987856085|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1987856085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1987856085, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1987856085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1987856085} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1987856085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1987856085, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1987856085|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1987856085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1987856085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 04:11:57,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1424712963 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1424712963 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1424712963| ~x$r_buff0_thd0~0_In1424712963)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1424712963| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1424712963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1424712963} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1424712963, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1424712963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1424712963} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 04:11:57,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1286572531 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1286572531 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1286572531 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1286572531 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1286572531|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-1286572531 |ULTIMATE.start_main_#t~ite39_Out-1286572531|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1286572531, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1286572531, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1286572531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1286572531} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1286572531, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1286572531|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1286572531, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1286572531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1286572531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 04:11:57,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~y~0_54 2) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|) (= 0 v_~__unbuffered_p0_EAX~0_44) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:11:57,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:11:57 BasicIcfg [2019-12-27 04:11:57,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:11:57,915 INFO L168 Benchmark]: Toolchain (without parser) took 12745.19 ms. Allocated memory was 137.9 MB in the beginning and 382.7 MB in the end (delta: 244.8 MB). Free memory was 100.4 MB in the beginning and 283.4 MB in the end (delta: -183.1 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:57,916 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 04:11:57,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.92 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 155.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:57,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.20 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 152.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:57,922 INFO L168 Benchmark]: Boogie Preprocessor took 37.14 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:57,923 INFO L168 Benchmark]: RCFGBuilder took 764.81 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 110.7 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:57,925 INFO L168 Benchmark]: TraceAbstraction took 11074.21 ms. Allocated memory was 202.9 MB in the beginning and 382.7 MB in the end (delta: 179.8 MB). Free memory was 110.0 MB in the beginning and 283.4 MB in the end (delta: -173.4 MB). Peak memory consumption was 6.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:57,935 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.92 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 155.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.20 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 152.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.14 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 764.81 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 110.7 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11074.21 ms. Allocated memory was 202.9 MB in the beginning and 382.7 MB in the end (delta: 179.8 MB). Free memory was 110.0 MB in the beginning and 283.4 MB in the end (delta: -173.4 MB). Peak memory consumption was 6.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2563, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] FCALL, FORK 0 pthread_create(&t2564, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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) [L767] 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 [!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)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 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)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 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)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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)) [L736] 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=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 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)) [L738] 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=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 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 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1362 SDtfs, 1368 SDslu, 2283 SDs, 0 SdLazy, 1342 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred 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: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2118 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 37528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...