/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/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:10:55,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:10:55,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:10:56,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:10:56,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:10:56,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:10:56,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:10:56,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:10:56,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:10:56,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:10:56,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:10:56,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:10:56,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:10:56,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:10:56,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:10:56,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:10:56,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:10:56,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:10:56,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:10:56,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:10:56,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:10:56,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:10:56,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:10:56,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:10:56,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:10:56,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:10:56,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:10:56,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:10:56,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:10:56,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:10:56,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:10:56,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:10:56,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:10:56,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:10:56,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:10:56,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:10:56,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:10:56,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:10:56,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:10:56,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:10:56,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:10:56,045 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 03:10:56,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:10:56,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:10:56,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:10:56,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:10:56,061 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:10:56,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:10:56,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:10:56,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:10:56,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:10:56,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:10:56,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:10:56,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:10:56,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:10:56,063 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:10:56,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:10:56,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:10:56,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:10:56,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:10:56,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:10:56,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:10:56,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:10:56,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:10:56,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:10:56,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:10:56,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:10:56,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:10:56,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:10:56,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:10:56,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:10:56,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:10:56,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:10:56,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:10:56,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:10:56,382 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:10:56,384 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-27 03:10:56,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c762185/1171386e7000441eac66cb0d3655303c/FLAG173a8dbfe [2019-12-27 03:10:56,989 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:10:56,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-27 03:10:57,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c762185/1171386e7000441eac66cb0d3655303c/FLAG173a8dbfe [2019-12-27 03:10:57,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c762185/1171386e7000441eac66cb0d3655303c [2019-12-27 03:10:57,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:10:57,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:10:57,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:10:57,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:10:57,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:10:57,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:57,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cfcebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57, skipping insertion in model container [2019-12-27 03:10:57,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:57,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:10:57,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:10:57,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:10:57,800 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:10:57,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:10:57,983 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:10:57,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57 WrapperNode [2019-12-27 03:10:57,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:10:57,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:10:57,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:10:57,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:10:57,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:10:58,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:10:58,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:10:58,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:10:58,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (1/1) ... [2019-12-27 03:10:58,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:10:58,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:10:58,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:10:58,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:10:58,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (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 03:10:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:10:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:10:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:10:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:10:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:10:58,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:10:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:10:58,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:10:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:10:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:10:58,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:10:58,177 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 03:10:58,874 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:10:58,874 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:10:58,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:10:58 BoogieIcfgContainer [2019-12-27 03:10:58,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:10:58,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:10:58,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:10:58,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:10:58,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:10:57" (1/3) ... [2019-12-27 03:10:58,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4052b9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:10:58, skipping insertion in model container [2019-12-27 03:10:58,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:57" (2/3) ... [2019-12-27 03:10:58,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4052b9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:10:58, skipping insertion in model container [2019-12-27 03:10:58,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:10:58" (3/3) ... [2019-12-27 03:10:58,890 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-12-27 03:10:58,901 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:10:58,901 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:10:58,912 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:10:58,913 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:10:58,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,025 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:10:59,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:10:59,072 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:10:59,072 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:10:59,073 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:10:59,073 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:10:59,073 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:10:59,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:10:59,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:10:59,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:10:59,096 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-27 03:10:59,097 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 03:10:59,203 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 03:10:59,204 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:10:59,218 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 03:10:59,235 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 03:10:59,278 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 03:10:59,278 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:10:59,283 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 03:10:59,296 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 03:10:59,297 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:11:03,846 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:11:03,965 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 03:11:04,007 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-27 03:11:04,007 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-27 03:11:04,011 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-27 03:11:04,400 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-27 03:11:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-27 03:11:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:11:04,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:04,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:11:04,410 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-27 03:11:04,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:04,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969248720] [2019-12-27 03:11:04,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:11:04,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969248720] [2019-12-27 03:11:04,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:04,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:11:04,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515905196] [2019-12-27 03:11:04,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:04,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:04,732 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-27 03:11:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:04,957 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-27 03:11:04,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:04,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:11:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:05,078 INFO L225 Difference]: With dead ends: 5990 [2019-12-27 03:11:05,078 INFO L226 Difference]: Without dead ends: 5642 [2019-12-27 03:11:05,079 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 03:11:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-27 03:11:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-27 03:11:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-27 03:11:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-27 03:11:05,469 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-27 03:11:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:05,470 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-27 03:11:05,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-27 03:11:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:11:05,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:05,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:05,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-27 03:11:05,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:05,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045457437] [2019-12-27 03:11:05,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:05,546 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 03:11:05,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045457437] [2019-12-27 03:11:05,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:05,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:05,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183142766] [2019-12-27 03:11:05,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:05,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:05,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:05,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:05,550 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 3 states. [2019-12-27 03:11:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:05,588 INFO L93 Difference]: Finished difference Result 1157 states and 2862 transitions. [2019-12-27 03:11:05,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:05,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 03:11:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:05,596 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 03:11:05,596 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 03:11:05,597 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 03:11:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 03:11:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2019-12-27 03:11:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-12-27 03:11:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2862 transitions. [2019-12-27 03:11:05,627 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2862 transitions. Word has length 11 [2019-12-27 03:11:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:05,627 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 2862 transitions. [2019-12-27 03:11:05,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2862 transitions. [2019-12-27 03:11:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:11:05,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:05,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:05,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-27 03:11:05,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:05,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305108505] [2019-12-27 03:11:05,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:05,778 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 03:11:05,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305108505] [2019-12-27 03:11:05,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:05,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:11:05,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595475701] [2019-12-27 03:11:05,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:05,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:05,783 INFO L87 Difference]: Start difference. First operand 1157 states and 2862 transitions. Second operand 3 states. [2019-12-27 03:11:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:05,902 INFO L93 Difference]: Finished difference Result 1787 states and 4461 transitions. [2019-12-27 03:11:05,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:05,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 03:11:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:05,916 INFO L225 Difference]: With dead ends: 1787 [2019-12-27 03:11:05,916 INFO L226 Difference]: Without dead ends: 1787 [2019-12-27 03:11:05,917 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 03:11:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-12-27 03:11:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1271. [2019-12-27 03:11:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-27 03:11:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 3173 transitions. [2019-12-27 03:11:05,968 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 3173 transitions. Word has length 14 [2019-12-27 03:11:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:05,968 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 3173 transitions. [2019-12-27 03:11:05,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 3173 transitions. [2019-12-27 03:11:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:11:05,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:05,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:05,970 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-27 03:11:05,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:05,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118994197] [2019-12-27 03:11:05,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:06,083 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 03:11:06,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118994197] [2019-12-27 03:11:06,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:06,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:06,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598091606] [2019-12-27 03:11:06,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:06,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:06,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:06,087 INFO L87 Difference]: Start difference. First operand 1271 states and 3173 transitions. Second operand 4 states. [2019-12-27 03:11:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:06,283 INFO L93 Difference]: Finished difference Result 1720 states and 4173 transitions. [2019-12-27 03:11:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:11:06,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:11:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:06,294 INFO L225 Difference]: With dead ends: 1720 [2019-12-27 03:11:06,294 INFO L226 Difference]: Without dead ends: 1720 [2019-12-27 03:11:06,294 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 03:11:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-12-27 03:11:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1552. [2019-12-27 03:11:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-12-27 03:11:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3797 transitions. [2019-12-27 03:11:06,344 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 3797 transitions. Word has length 14 [2019-12-27 03:11:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:06,345 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 3797 transitions. [2019-12-27 03:11:06,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 3797 transitions. [2019-12-27 03:11:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:11:06,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:06,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:06,346 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-27 03:11:06,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:06,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078872801] [2019-12-27 03:11:06,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:06,429 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 03:11:06,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078872801] [2019-12-27 03:11:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:06,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:06,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126216560] [2019-12-27 03:11:06,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:06,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:06,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:06,432 INFO L87 Difference]: Start difference. First operand 1552 states and 3797 transitions. Second operand 4 states. [2019-12-27 03:11:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:06,619 INFO L93 Difference]: Finished difference Result 1981 states and 4771 transitions. [2019-12-27 03:11:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:11:06,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:11:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:06,632 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 03:11:06,632 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 03:11:06,633 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 03:11:06,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 03:11:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1581. [2019-12-27 03:11:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-27 03:11:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3869 transitions. [2019-12-27 03:11:06,675 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3869 transitions. Word has length 14 [2019-12-27 03:11:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:06,676 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3869 transitions. [2019-12-27 03:11:06,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3869 transitions. [2019-12-27 03:11:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:11:06,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:06,679 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 03:11:06,679 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-27 03:11:06,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:06,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886943743] [2019-12-27 03:11:06,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:11:06,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886943743] [2019-12-27 03:11:06,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:06,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:11:06,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212555726] [2019-12-27 03:11:06,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:06,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:06,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:06,725 INFO L87 Difference]: Start difference. First operand 1581 states and 3869 transitions. Second operand 4 states. [2019-12-27 03:11:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:06,744 INFO L93 Difference]: Finished difference Result 702 states and 1600 transitions. [2019-12-27 03:11:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:11:06,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 03:11:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:06,749 INFO L225 Difference]: With dead ends: 702 [2019-12-27 03:11:06,749 INFO L226 Difference]: Without dead ends: 702 [2019-12-27 03:11:06,750 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 03:11:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-27 03:11:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 670. [2019-12-27 03:11:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 03:11:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1532 transitions. [2019-12-27 03:11:06,765 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1532 transitions. Word has length 26 [2019-12-27 03:11:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:06,765 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1532 transitions. [2019-12-27 03:11:06,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1532 transitions. [2019-12-27 03:11:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:06,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:06,768 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 03:11:06,768 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1430443939, now seen corresponding path program 1 times [2019-12-27 03:11:06,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:06,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557726955] [2019-12-27 03:11:06,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:11:06,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557726955] [2019-12-27 03:11:06,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:06,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:11:06,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513168452] [2019-12-27 03:11:06,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:11:06,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:11:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:11:06,860 INFO L87 Difference]: Start difference. First operand 670 states and 1532 transitions. Second operand 6 states. [2019-12-27 03:11:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:07,170 INFO L93 Difference]: Finished difference Result 1768 states and 3997 transitions. [2019-12-27 03:11:07,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:11:07,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:11:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:07,177 INFO L225 Difference]: With dead ends: 1768 [2019-12-27 03:11:07,177 INFO L226 Difference]: Without dead ends: 1174 [2019-12-27 03:11:07,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:11:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-12-27 03:11:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 749. [2019-12-27 03:11:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-12-27 03:11:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1716 transitions. [2019-12-27 03:11:07,197 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1716 transitions. Word has length 41 [2019-12-27 03:11:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:07,198 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1716 transitions. [2019-12-27 03:11:07,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:11:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1716 transitions. [2019-12-27 03:11:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:07,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:07,201 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 03:11:07,201 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash -367672255, now seen corresponding path program 2 times [2019-12-27 03:11:07,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:07,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865560181] [2019-12-27 03:11:07,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:11:07,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865560181] [2019-12-27 03:11:07,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:07,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:07,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237960892] [2019-12-27 03:11:07,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:07,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:07,258 INFO L87 Difference]: Start difference. First operand 749 states and 1716 transitions. Second operand 3 states. [2019-12-27 03:11:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:07,268 INFO L93 Difference]: Finished difference Result 1153 states and 2657 transitions. [2019-12-27 03:11:07,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:07,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 03:11:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:07,271 INFO L225 Difference]: With dead ends: 1153 [2019-12-27 03:11:07,272 INFO L226 Difference]: Without dead ends: 424 [2019-12-27 03:11:07,272 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 03:11:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-27 03:11:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-12-27 03:11:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-12-27 03:11:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 974 transitions. [2019-12-27 03:11:07,282 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 974 transitions. Word has length 41 [2019-12-27 03:11:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:07,282 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 974 transitions. [2019-12-27 03:11:07,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 974 transitions. [2019-12-27 03:11:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:07,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:07,284 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 03:11:07,284 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:07,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1769242661, now seen corresponding path program 3 times [2019-12-27 03:11:07,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:07,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021302799] [2019-12-27 03:11:07,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:07,513 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 03:11:07,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021302799] [2019-12-27 03:11:07,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:07,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:11:07,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661774857] [2019-12-27 03:11:07,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:11:07,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:11:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:11:07,518 INFO L87 Difference]: Start difference. First operand 424 states and 974 transitions. Second operand 8 states. [2019-12-27 03:11:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:08,032 INFO L93 Difference]: Finished difference Result 714 states and 1499 transitions. [2019-12-27 03:11:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:11:08,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 03:11:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:08,036 INFO L225 Difference]: With dead ends: 714 [2019-12-27 03:11:08,036 INFO L226 Difference]: Without dead ends: 714 [2019-12-27 03:11:08,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:11:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-27 03:11:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 539. [2019-12-27 03:11:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-27 03:11:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1139 transitions. [2019-12-27 03:11:08,051 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1139 transitions. Word has length 41 [2019-12-27 03:11:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:08,052 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1139 transitions. [2019-12-27 03:11:08,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:11:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1139 transitions. [2019-12-27 03:11:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:08,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:08,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:08,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash 888874829, now seen corresponding path program 4 times [2019-12-27 03:11:08,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:08,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394222671] [2019-12-27 03:11:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:08,133 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 03:11:08,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394222671] [2019-12-27 03:11:08,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:08,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:11:08,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024998131] [2019-12-27 03:11:08,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:11:08,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:11:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:11:08,136 INFO L87 Difference]: Start difference. First operand 539 states and 1139 transitions. Second operand 7 states. [2019-12-27 03:11:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:08,332 INFO L93 Difference]: Finished difference Result 1307 states and 2699 transitions. [2019-12-27 03:11:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:11:08,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 03:11:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:08,343 INFO L225 Difference]: With dead ends: 1307 [2019-12-27 03:11:08,343 INFO L226 Difference]: Without dead ends: 976 [2019-12-27 03:11:08,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:11:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-27 03:11:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 538. [2019-12-27 03:11:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-27 03:11:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1139 transitions. [2019-12-27 03:11:08,362 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1139 transitions. Word has length 41 [2019-12-27 03:11:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:08,363 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1139 transitions. [2019-12-27 03:11:08,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:11:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1139 transitions. [2019-12-27 03:11:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:08,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:08,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:08,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1585763671, now seen corresponding path program 5 times [2019-12-27 03:11:08,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:08,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324587695] [2019-12-27 03:11:08,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:08,483 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 03:11:08,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324587695] [2019-12-27 03:11:08,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:08,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:11:08,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167206152] [2019-12-27 03:11:08,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:11:08,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:11:08,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:11:08,486 INFO L87 Difference]: Start difference. First operand 538 states and 1139 transitions. Second operand 6 states. [2019-12-27 03:11:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:08,923 INFO L93 Difference]: Finished difference Result 810 states and 1687 transitions. [2019-12-27 03:11:08,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:11:08,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:11:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:08,930 INFO L225 Difference]: With dead ends: 810 [2019-12-27 03:11:08,930 INFO L226 Difference]: Without dead ends: 810 [2019-12-27 03:11:08,931 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 03:11:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-12-27 03:11:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 554. [2019-12-27 03:11:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-27 03:11:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1171 transitions. [2019-12-27 03:11:08,943 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1171 transitions. Word has length 41 [2019-12-27 03:11:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:08,944 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1171 transitions. [2019-12-27 03:11:08,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:11:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1171 transitions. [2019-12-27 03:11:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:11:08,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:08,945 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 03:11:08,946 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash -101907359, now seen corresponding path program 6 times [2019-12-27 03:11:08,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:08,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477761043] [2019-12-27 03:11:08,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:09,027 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 03:11:09,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477761043] [2019-12-27 03:11:09,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:09,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:09,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787760150] [2019-12-27 03:11:09,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:09,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:09,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:09,029 INFO L87 Difference]: Start difference. First operand 554 states and 1171 transitions. Second operand 3 states. [2019-12-27 03:11:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:09,041 INFO L93 Difference]: Finished difference Result 552 states and 1166 transitions. [2019-12-27 03:11:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:09,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 03:11:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:09,044 INFO L225 Difference]: With dead ends: 552 [2019-12-27 03:11:09,044 INFO L226 Difference]: Without dead ends: 552 [2019-12-27 03:11:09,044 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 03:11:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-27 03:11:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 461. [2019-12-27 03:11:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 03:11:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 989 transitions. [2019-12-27 03:11:09,063 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 989 transitions. Word has length 41 [2019-12-27 03:11:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:09,063 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 989 transitions. [2019-12-27 03:11:09,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 989 transitions. [2019-12-27 03:11:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 03:11:09,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:09,065 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 03:11:09,065 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:11:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 1 times [2019-12-27 03:11:09,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:09,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065902200] [2019-12-27 03:11:09,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:11:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:11:09,205 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:11:09,205 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:11:09,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| 4) |v_#length_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_35|) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35|) |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35| 1)) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_35|, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_35|, ~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, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~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, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1635~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:11:09,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-12-27 03:11:09,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~__unbuffered_p1_EAX~0_Out-1432876340 ~y~0_Out-1432876340) (= ~__unbuffered_p1_EBX~0_Out-1432876340 ~y~0_Out-1432876340) (= ~x$r_buff0_thd1~0_In-1432876340 ~x$r_buff1_thd1~0_Out-1432876340) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1432876340 0)) (= ~x$r_buff1_thd0~0_Out-1432876340 ~x$r_buff0_thd0~0_In-1432876340) (= ~x$r_buff1_thd2~0_Out-1432876340 ~x$r_buff0_thd2~0_In-1432876340) (= ~x$r_buff0_thd2~0_Out-1432876340 1) (= 1 ~y~0_Out-1432876340)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1432876340, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1432876340, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1432876340, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1432876340} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1432876340, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1432876340, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1432876340, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1432876340, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1432876340, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1432876340, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1432876340, ~y~0=~y~0_Out-1432876340, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1432876340, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1432876340} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:11:09,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 03:11:09,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1386332408 256) 0))) (or (let ((.cse0 (not (= 0 (mod ~x$r_buff0_thd1~0_In-1386332408 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out-1386332408| |P0Thread1of1ForFork1_#t~ite22_Out-1386332408|) (or .cse0 (not (= (mod ~x$r_buff1_thd1~0_In-1386332408 256) 0))) (not (= (mod ~x$w_buff0_used~0_In-1386332408 256) 0)) .cse1 (or (not (= 0 (mod ~x$w_buff1_used~0_In-1386332408 256))) .cse0) (= |P0Thread1of1ForFork1_#t~ite22_Out-1386332408| 0) (= |P0Thread1of1ForFork1_#t~ite24_Out-1386332408| |P0Thread1of1ForFork1_#t~ite23_Out-1386332408|))) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite24_Out-1386332408| ~x$r_buff1_thd1~0_In-1386332408) (= |P0Thread1of1ForFork1_#t~ite22_In-1386332408| |P0Thread1of1ForFork1_#t~ite22_Out-1386332408|) (= |P0Thread1of1ForFork1_#t~ite23_In-1386332408| |P0Thread1of1ForFork1_#t~ite23_Out-1386332408|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1386332408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1386332408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1386332408, ~weak$$choice2~0=~weak$$choice2~0_In-1386332408, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-1386332408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1386332408, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-1386332408|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1386332408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1386332408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1386332408, ~weak$$choice2~0=~weak$$choice2~0_In-1386332408, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-1386332408|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-1386332408|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-1386332408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1386332408} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 03:11:09,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:11:09,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In555447706 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In555447706 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out555447706|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In555447706 |P1Thread1of1ForFork0_#t~ite28_Out555447706|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In555447706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In555447706} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In555447706, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out555447706|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In555447706} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:11:09,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In2119566606 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In2119566606 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2119566606 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2119566606 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out2119566606| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out2119566606| ~x$w_buff1_used~0_In2119566606) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2119566606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2119566606, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2119566606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119566606} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2119566606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2119566606, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2119566606, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2119566606|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119566606} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:11:09,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1460869793 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1460869793 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1460869793 ~x$r_buff0_thd2~0_Out1460869793)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1460869793) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1460869793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1460869793} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1460869793|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1460869793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1460869793} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:11:09,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In2036594775 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2036594775 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2036594775 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2036594775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out2036594775|)) (and (= ~x$r_buff1_thd2~0_In2036594775 |P1Thread1of1ForFork0_#t~ite31_Out2036594775|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2036594775, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2036594775, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2036594775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2036594775} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2036594775|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2036594775, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2036594775, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2036594775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2036594775} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:11:09,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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 03:11:09,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:11:09,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1609096552 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1609096552 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1609096552 |ULTIMATE.start_main_#t~ite34_Out1609096552|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In1609096552 |ULTIMATE.start_main_#t~ite34_Out1609096552|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1609096552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1609096552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1609096552, ~x~0=~x~0_In1609096552} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1609096552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1609096552, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1609096552, ~x~0=~x~0_In1609096552, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1609096552|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 03:11:09,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 03:11:09,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1751851523 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1751851523 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1751851523| ~x$w_buff0_used~0_In1751851523)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1751851523|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1751851523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751851523} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1751851523, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1751851523|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751851523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 03:11:09,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1714587166 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1714587166 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1714587166 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1714587166 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-1714587166| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-1714587166| ~x$w_buff1_used~0_In-1714587166) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1714587166, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1714587166, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1714587166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1714587166} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1714587166, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1714587166, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1714587166|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1714587166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1714587166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 03:11:09,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1147016433 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1147016433 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1147016433|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1147016433| ~x$r_buff0_thd0~0_In-1147016433)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1147016433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1147016433} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1147016433, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1147016433|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1147016433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 03:11:09,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In750900687 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In750900687 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In750900687 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In750900687 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out750900687| ~x$r_buff1_thd0~0_In750900687)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out750900687| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In750900687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In750900687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In750900687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In750900687} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In750900687, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out750900687|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In750900687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In750900687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In750900687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 03:11:09,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y~0_42 2) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~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 03:11:09,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:11:09 BasicIcfg [2019-12-27 03:11:09,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:11:09,314 INFO L168 Benchmark]: Toolchain (without parser) took 12080.02 ms. Allocated memory was 141.6 MB in the beginning and 422.6 MB in the end (delta: 281.0 MB). Free memory was 98.0 MB in the beginning and 257.5 MB in the end (delta: -159.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:09,315 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 03:11:09,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.98 ms. Allocated memory was 141.6 MB in the beginning and 199.8 MB in the end (delta: 58.2 MB). Free memory was 97.6 MB in the beginning and 154.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:09,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 199.8 MB. Free memory was 154.0 MB in the beginning and 151.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 03:11:09,317 INFO L168 Benchmark]: Boogie Preprocessor took 52.77 ms. Allocated memory is still 199.8 MB. Free memory was 151.8 MB in the beginning and 149.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:09,318 INFO L168 Benchmark]: RCFGBuilder took 763.86 ms. Allocated memory is still 199.8 MB. Free memory was 149.6 MB in the beginning and 108.1 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:09,321 INFO L168 Benchmark]: TraceAbstraction took 10433.12 ms. Allocated memory was 199.8 MB in the beginning and 422.6 MB in the end (delta: 222.8 MB). Free memory was 108.1 MB in the beginning and 257.5 MB in the end (delta: -149.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:09,328 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.39 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.98 ms. Allocated memory was 141.6 MB in the beginning and 199.8 MB in the end (delta: 58.2 MB). Free memory was 97.6 MB in the beginning and 154.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 199.8 MB. Free memory was 154.0 MB in the beginning and 151.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.77 ms. Allocated memory is still 199.8 MB. Free memory was 151.8 MB in the beginning and 149.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.86 ms. Allocated memory is still 199.8 MB. Free memory was 149.6 MB in the beginning and 108.1 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10433.12 ms. Allocated memory was 199.8 MB in the beginning and 422.6 MB in the end (delta: 222.8 MB). Free memory was 108.1 MB in the beginning and 257.5 MB in the end (delta: -149.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L736] 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) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L737] 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)) [L738] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L738] 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)) [L739] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L739] 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)) [L740] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L740] 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)) [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L808] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 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, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1370 SDtfs, 1145 SDslu, 2682 SDs, 0 SdLazy, 1376 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6150occurred 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, 12 MinimizatonAttempts, 2501 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 35182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...