/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/safe024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:52:21,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:52:21,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:52:21,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:52:21,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:52:21,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:52:21,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:52:21,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:52:21,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:52:21,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:52:21,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:52:21,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:52:21,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:52:21,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:52:21,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:52:21,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:52:21,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:52:21,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:52:21,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:52:21,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:52:21,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:52:21,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:52:21,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:52:21,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:52:21,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:52:21,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:52:21,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:52:21,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:52:21,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:52:21,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:52:21,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:52:21,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:52:21,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:52:21,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:52:21,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:52:21,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:52:21,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:52:21,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:52:21,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:52:21,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:52:21,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:52:21,075 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-18 18:52:21,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:52:21,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:52:21,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:52:21,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:52:21,092 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:52:21,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:52:21,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:52:21,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:52:21,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:52:21,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:52:21,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:52:21,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:52:21,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:52:21,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:52:21,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:52:21,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:52:21,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:52:21,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:52:21,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:52:21,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:52:21,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:52:21,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:52:21,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:52:21,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:52:21,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:52:21,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:52:21,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:52:21,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:52:21,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:52:21,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:52:21,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:52:21,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:52:21,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:52:21,408 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:52:21,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-18 18:52:21,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09c774da/e770797e334743f3a16eeefac99d2645/FLAG35f3b4e71 [2019-12-18 18:52:22,070 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:52:22,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-18 18:52:22,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09c774da/e770797e334743f3a16eeefac99d2645/FLAG35f3b4e71 [2019-12-18 18:52:22,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09c774da/e770797e334743f3a16eeefac99d2645 [2019-12-18 18:52:22,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:52:22,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:52:22,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:52:22,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:52:22,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:52:22,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:52:22" (1/1) ... [2019-12-18 18:52:22,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6deafab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:22, skipping insertion in model container [2019-12-18 18:52:22,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:52:22" (1/1) ... [2019-12-18 18:52:22,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:52:22,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:52:22,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:52:23,000 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:52:23,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:52:23,181 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:52:23,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23 WrapperNode [2019-12-18 18:52:23,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:52:23,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:52:23,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:52:23,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:52:23,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:52:23,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:52:23,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:52:23,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:52:23,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (1/1) ... [2019-12-18 18:52:23,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:52:23,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:52:23,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:52:23,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:52:23,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (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-18 18:52:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:52:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:52:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:52:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:52:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:52:23,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:52:23,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:52:23,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:52:23,381 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:52:23,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:52:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:52:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:52:23,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:52:23,386 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:52:24,149 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:52:24,149 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:52:24,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:52:24 BoogieIcfgContainer [2019-12-18 18:52:24,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:52:24,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:52:24,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:52:24,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:52:24,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:52:22" (1/3) ... [2019-12-18 18:52:24,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5231ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:52:24, skipping insertion in model container [2019-12-18 18:52:24,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:23" (2/3) ... [2019-12-18 18:52:24,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5231ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:52:24, skipping insertion in model container [2019-12-18 18:52:24,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:52:24" (3/3) ... [2019-12-18 18:52:24,161 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2019-12-18 18:52:24,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:52:24,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:52:24,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:52:24,179 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:52:24,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,221 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,258 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,258 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,290 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,291 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:24,314 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:52:24,335 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:52:24,335 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:52:24,335 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:52:24,335 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:52:24,335 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:52:24,335 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:52:24,336 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:52:24,336 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:52:24,353 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 18:52:24,354 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:52:24,443 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:52:24,444 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:52:24,461 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:52:24,489 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:52:24,534 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:52:24,534 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:52:24,547 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:52:24,569 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:52:24,571 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:52:30,003 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 18:52:30,132 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 18:52:30,160 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-18 18:52:30,160 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 18:52:30,165 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-18 18:52:42,220 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 18:52:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 18:52:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:52:42,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:42,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:52:42,229 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:52:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-18 18:52:42,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:42,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437040101] [2019-12-18 18:52:42,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:42,509 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-18 18:52:42,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437040101] [2019-12-18 18:52:42,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:42,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:52:42,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802893290] [2019-12-18 18:52:42,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:52:42,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:52:42,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:52:42,536 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 18:52:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:45,704 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-18 18:52:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:52:45,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:52:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:46,302 INFO L225 Difference]: With dead ends: 87834 [2019-12-18 18:52:46,302 INFO L226 Difference]: Without dead ends: 82738 [2019-12-18 18:52:46,304 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-18 18:52:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-18 18:52:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-18 18:52:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-18 18:52:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-18 18:52:54,003 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-18 18:52:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:54,004 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-18 18:52:54,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:52:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-18 18:52:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:52:54,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:54,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:52:54,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:52:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-18 18:52:54,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:54,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916664585] [2019-12-18 18:52:54,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:54,175 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-18 18:52:54,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916664585] [2019-12-18 18:52:54,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:54,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:52:54,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179786355] [2019-12-18 18:52:54,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:52:54,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:52:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:52:54,181 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-18 18:52:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:57,868 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-18 18:52:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:52:57,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:52:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:58,489 INFO L225 Difference]: With dead ends: 127286 [2019-12-18 18:52:58,489 INFO L226 Difference]: Without dead ends: 127202 [2019-12-18 18:52:58,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:53:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-18 18:53:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-18 18:53:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-18 18:53:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-18 18:53:10,766 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-18 18:53:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:10,767 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-18 18:53:10,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:53:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-18 18:53:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:53:10,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:10,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:10,772 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:10,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-18 18:53:10,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:10,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614772651] [2019-12-18 18:53:10,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:53:10,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614772651] [2019-12-18 18:53:10,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:10,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:53:10,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147520949] [2019-12-18 18:53:10,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:53:10,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:53:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:53:10,826 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-18 18:53:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:10,947 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-18 18:53:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:53:10,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:53:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:11,028 INFO L225 Difference]: With dead ends: 28492 [2019-12-18 18:53:11,029 INFO L226 Difference]: Without dead ends: 28492 [2019-12-18 18:53:11,029 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-18 18:53:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-18 18:53:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-18 18:53:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-18 18:53:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-18 18:53:11,658 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-18 18:53:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:11,658 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-18 18:53:11,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:53:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-18 18:53:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:53:11,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:11,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:11,661 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:11,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-18 18:53:11,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:11,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190889473] [2019-12-18 18:53:11,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:11,753 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-18 18:53:11,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190889473] [2019-12-18 18:53:11,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:11,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:53:11,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615355364] [2019-12-18 18:53:11,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:53:11,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:11,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:53:11,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:53:11,755 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-18 18:53:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:14,128 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-18 18:53:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:53:14,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:53:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:14,202 INFO L225 Difference]: With dead ends: 41156 [2019-12-18 18:53:14,202 INFO L226 Difference]: Without dead ends: 41141 [2019-12-18 18:53:14,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:53:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-18 18:53:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-18 18:53:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-18 18:53:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-18 18:53:14,841 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-18 18:53:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:14,842 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-18 18:53:14,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:53:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-18 18:53:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:53:14,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:14,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:14,854 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-18 18:53:14,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:14,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916046098] [2019-12-18 18:53:14,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:14,993 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-18 18:53:14,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916046098] [2019-12-18 18:53:14,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:14,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:53:14,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752727232] [2019-12-18 18:53:14,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:53:14,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:14,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:53:14,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:53:14,996 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-18 18:53:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:16,267 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-18 18:53:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:53:16,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:53:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:16,374 INFO L225 Difference]: With dead ends: 48363 [2019-12-18 18:53:16,375 INFO L226 Difference]: Without dead ends: 48336 [2019-12-18 18:53:16,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:53:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-18 18:53:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-18 18:53:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-18 18:53:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-18 18:53:17,116 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-18 18:53:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:17,116 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-18 18:53:17,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:53:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-18 18:53:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:53:17,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:17,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:17,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-18 18:53:17,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:17,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374058523] [2019-12-18 18:53:17,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:17,197 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-18 18:53:17,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374058523] [2019-12-18 18:53:17,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:17,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:53:17,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258839229] [2019-12-18 18:53:17,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:53:17,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:53:17,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:53:17,199 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-18 18:53:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:17,270 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-18 18:53:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:53:17,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:53:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:17,293 INFO L225 Difference]: With dead ends: 12861 [2019-12-18 18:53:17,294 INFO L226 Difference]: Without dead ends: 12861 [2019-12-18 18:53:17,294 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-18 18:53:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-18 18:53:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-18 18:53:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-18 18:53:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-18 18:53:17,558 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-18 18:53:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:17,559 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-18 18:53:17,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:53:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-18 18:53:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:53:17,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:17,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:17,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-18 18:53:17,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:17,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123381279] [2019-12-18 18:53:17,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:17,682 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-18 18:53:17,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123381279] [2019-12-18 18:53:17,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:17,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:53:17,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495818660] [2019-12-18 18:53:17,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:53:17,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:53:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:53:17,685 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-18 18:53:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:17,750 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-18 18:53:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:53:17,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 18:53:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:17,777 INFO L225 Difference]: With dead ends: 11425 [2019-12-18 18:53:17,777 INFO L226 Difference]: Without dead ends: 11425 [2019-12-18 18:53:17,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:53:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-18 18:53:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-18 18:53:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-18 18:53:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-18 18:53:18,127 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-18 18:53:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:18,128 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-18 18:53:18,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:53:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-18 18:53:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:18,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:18,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:18,147 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-18 18:53:18,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:18,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082216057] [2019-12-18 18:53:18,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:18,268 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-18 18:53:18,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082216057] [2019-12-18 18:53:18,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:18,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:53:18,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605011700] [2019-12-18 18:53:18,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:53:18,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:18,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:53:18,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:53:18,271 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-18 18:53:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:18,369 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-18 18:53:18,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:53:18,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 18:53:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:18,389 INFO L225 Difference]: With dead ends: 20009 [2019-12-18 18:53:18,389 INFO L226 Difference]: Without dead ends: 9365 [2019-12-18 18:53:18,390 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-18 18:53:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-18 18:53:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-18 18:53:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-18 18:53:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-18 18:53:18,562 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-18 18:53:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:18,563 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-18 18:53:18,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:53:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-18 18:53:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:18,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:18,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:18,578 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-18 18:53:18,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:18,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373655193] [2019-12-18 18:53:18,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:18,688 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-18 18:53:18,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373655193] [2019-12-18 18:53:18,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:18,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:53:18,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889866401] [2019-12-18 18:53:18,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:53:18,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:53:18,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:53:18,692 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-18 18:53:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:19,083 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-18 18:53:19,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:53:19,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:53:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:19,110 INFO L225 Difference]: With dead ends: 23182 [2019-12-18 18:53:19,110 INFO L226 Difference]: Without dead ends: 18276 [2019-12-18 18:53:19,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:53:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-18 18:53:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-18 18:53:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-18 18:53:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-18 18:53:19,338 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-18 18:53:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:19,338 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-18 18:53:19,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:53:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-18 18:53:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:19,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:19,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:19,354 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-18 18:53:19,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:19,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487794113] [2019-12-18 18:53:19,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:19,453 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-18 18:53:19,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487794113] [2019-12-18 18:53:19,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:19,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:53:19,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471989765] [2019-12-18 18:53:19,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:53:19,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:53:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:53:19,455 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-18 18:53:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:19,869 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-18 18:53:19,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:53:19,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:53:19,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:19,907 INFO L225 Difference]: With dead ends: 27840 [2019-12-18 18:53:19,907 INFO L226 Difference]: Without dead ends: 19924 [2019-12-18 18:53:19,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:53:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-18 18:53:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-18 18:53:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-18 18:53:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-18 18:53:20,165 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-18 18:53:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:20,165 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-18 18:53:20,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:53:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-18 18:53:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:20,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:20,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:20,184 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:20,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-18 18:53:20,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:20,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232595598] [2019-12-18 18:53:20,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:20,294 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-18 18:53:20,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232595598] [2019-12-18 18:53:20,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:20,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:53:20,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860732674] [2019-12-18 18:53:20,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:53:20,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:53:20,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:53:20,297 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-18 18:53:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:20,898 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-18 18:53:20,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:53:20,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:53:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:20,937 INFO L225 Difference]: With dead ends: 25803 [2019-12-18 18:53:20,937 INFO L226 Difference]: Without dead ends: 23832 [2019-12-18 18:53:20,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:53:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-18 18:53:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-18 18:53:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-18 18:53:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-18 18:53:21,216 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-18 18:53:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:21,216 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-18 18:53:21,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:53:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-18 18:53:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:21,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:21,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:21,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:21,232 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-18 18:53:21,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:21,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447481290] [2019-12-18 18:53:21,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:21,285 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-18 18:53:21,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447481290] [2019-12-18 18:53:21,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:21,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:53:21,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689012306] [2019-12-18 18:53:21,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:53:21,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:53:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:53:21,289 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-18 18:53:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:21,384 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-18 18:53:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:53:21,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:53:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:21,410 INFO L225 Difference]: With dead ends: 18737 [2019-12-18 18:53:21,410 INFO L226 Difference]: Without dead ends: 18737 [2019-12-18 18:53:21,410 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-18 18:53:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-18 18:53:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-18 18:53:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-18 18:53:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-18 18:53:21,696 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-18 18:53:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:21,696 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-18 18:53:21,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:53:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-18 18:53:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:21,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:21,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:21,716 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-18 18:53:21,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:21,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845419180] [2019-12-18 18:53:21,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:21,846 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-18 18:53:21,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845419180] [2019-12-18 18:53:21,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:21,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:53:21,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561411010] [2019-12-18 18:53:21,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:53:21,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:53:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:53:21,849 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-18 18:53:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:22,616 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-18 18:53:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:53:22,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 18:53:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:22,667 INFO L225 Difference]: With dead ends: 31543 [2019-12-18 18:53:22,667 INFO L226 Difference]: Without dead ends: 31459 [2019-12-18 18:53:22,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:53:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-18 18:53:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-18 18:53:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-18 18:53:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-18 18:53:23,287 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-18 18:53:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:23,288 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-18 18:53:23,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:53:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-18 18:53:23,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:23,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:23,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:23,321 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:23,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-18 18:53:23,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:23,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641809984] [2019-12-18 18:53:23,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:23,427 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-18 18:53:23,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641809984] [2019-12-18 18:53:23,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:23,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:53:23,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230618710] [2019-12-18 18:53:23,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:53:23,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:23,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:53:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:53:23,429 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-18 18:53:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:24,378 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-18 18:53:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:53:24,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:53:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:24,426 INFO L225 Difference]: With dead ends: 31464 [2019-12-18 18:53:24,426 INFO L226 Difference]: Without dead ends: 31342 [2019-12-18 18:53:24,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:53:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-18 18:53:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-18 18:53:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-18 18:53:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-18 18:53:24,875 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-18 18:53:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:24,875 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-18 18:53:24,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:53:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-18 18:53:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:24,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:24,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:24,916 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-18 18:53:24,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:24,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769605038] [2019-12-18 18:53:24,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:25,038 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-18 18:53:25,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769605038] [2019-12-18 18:53:25,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:25,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:53:25,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117999380] [2019-12-18 18:53:25,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:53:25,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:53:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:53:25,040 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-18 18:53:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:26,753 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-18 18:53:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:53:26,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 18:53:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:26,816 INFO L225 Difference]: With dead ends: 41056 [2019-12-18 18:53:26,816 INFO L226 Difference]: Without dead ends: 41056 [2019-12-18 18:53:26,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:53:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-18 18:53:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-18 18:53:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-18 18:53:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-18 18:53:27,524 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-18 18:53:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:27,524 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-18 18:53:27,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:53:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-18 18:53:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:27,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:27,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:27,549 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-18 18:53:27,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:27,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55110264] [2019-12-18 18:53:27,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:27,604 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-18 18:53:27,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55110264] [2019-12-18 18:53:27,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:27,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:53:27,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295133462] [2019-12-18 18:53:27,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:53:27,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:53:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:53:27,606 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-18 18:53:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:27,681 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-18 18:53:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:53:27,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:53:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:27,704 INFO L225 Difference]: With dead ends: 17418 [2019-12-18 18:53:27,704 INFO L226 Difference]: Without dead ends: 17418 [2019-12-18 18:53:27,705 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-18 18:53:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-18 18:53:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-18 18:53:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-18 18:53:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-18 18:53:27,950 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-18 18:53:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:27,950 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-18 18:53:27,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:53:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-18 18:53:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:27,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:27,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:27,968 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-18 18:53:27,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:27,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190359476] [2019-12-18 18:53:27,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:28,178 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-18 18:53:28,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190359476] [2019-12-18 18:53:28,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:28,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:53:28,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075456250] [2019-12-18 18:53:28,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:53:28,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:53:28,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:53:28,181 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 11 states. [2019-12-18 18:53:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:29,273 INFO L93 Difference]: Finished difference Result 34904 states and 106417 transitions. [2019-12-18 18:53:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:53:29,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 18:53:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:29,323 INFO L225 Difference]: With dead ends: 34904 [2019-12-18 18:53:29,324 INFO L226 Difference]: Without dead ends: 33854 [2019-12-18 18:53:29,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 18:53:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33854 states. [2019-12-18 18:53:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33854 to 21618. [2019-12-18 18:53:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-12-18 18:53:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 65921 transitions. [2019-12-18 18:53:29,955 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 65921 transitions. Word has length 54 [2019-12-18 18:53:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:29,956 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 65921 transitions. [2019-12-18 18:53:29,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:53:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 65921 transitions. [2019-12-18 18:53:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:29,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:29,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:29,977 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash 211798304, now seen corresponding path program 2 times [2019-12-18 18:53:29,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:29,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494229452] [2019-12-18 18:53:29,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:30,160 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-18 18:53:30,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494229452] [2019-12-18 18:53:30,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:30,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:53:30,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996242201] [2019-12-18 18:53:30,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:53:30,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:30,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:53:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:53:30,163 INFO L87 Difference]: Start difference. First operand 21618 states and 65921 transitions. Second operand 11 states. [2019-12-18 18:53:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:31,275 INFO L93 Difference]: Finished difference Result 34597 states and 104764 transitions. [2019-12-18 18:53:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:53:31,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 18:53:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:31,340 INFO L225 Difference]: With dead ends: 34597 [2019-12-18 18:53:31,341 INFO L226 Difference]: Without dead ends: 25901 [2019-12-18 18:53:31,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:53:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25901 states. [2019-12-18 18:53:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25901 to 16668. [2019-12-18 18:53:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16668 states. [2019-12-18 18:53:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16668 states to 16668 states and 50247 transitions. [2019-12-18 18:53:31,943 INFO L78 Accepts]: Start accepts. Automaton has 16668 states and 50247 transitions. Word has length 54 [2019-12-18 18:53:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:31,943 INFO L462 AbstractCegarLoop]: Abstraction has 16668 states and 50247 transitions. [2019-12-18 18:53:31,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:53:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 16668 states and 50247 transitions. [2019-12-18 18:53:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:31,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:31,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:31,965 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 3 times [2019-12-18 18:53:31,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:31,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355297155] [2019-12-18 18:53:31,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:32,140 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-18 18:53:32,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355297155] [2019-12-18 18:53:32,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:32,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:53:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624195828] [2019-12-18 18:53:32,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:53:32,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:53:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:53:32,142 INFO L87 Difference]: Start difference. First operand 16668 states and 50247 transitions. Second operand 12 states. [2019-12-18 18:53:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:33,000 INFO L93 Difference]: Finished difference Result 26440 states and 79178 transitions. [2019-12-18 18:53:33,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:53:33,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 18:53:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:33,037 INFO L225 Difference]: With dead ends: 26440 [2019-12-18 18:53:33,038 INFO L226 Difference]: Without dead ends: 25711 [2019-12-18 18:53:33,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:53:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25711 states. [2019-12-18 18:53:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25711 to 16350. [2019-12-18 18:53:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16350 states. [2019-12-18 18:53:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16350 states to 16350 states and 49383 transitions. [2019-12-18 18:53:33,346 INFO L78 Accepts]: Start accepts. Automaton has 16350 states and 49383 transitions. Word has length 54 [2019-12-18 18:53:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:33,347 INFO L462 AbstractCegarLoop]: Abstraction has 16350 states and 49383 transitions. [2019-12-18 18:53:33,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:53:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 16350 states and 49383 transitions. [2019-12-18 18:53:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:33,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:33,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:33,364 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:33,364 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 4 times [2019-12-18 18:53:33,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:33,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027019331] [2019-12-18 18:53:33,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:33,431 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-18 18:53:33,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027019331] [2019-12-18 18:53:33,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:33,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:53:33,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271792771] [2019-12-18 18:53:33,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:53:33,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:33,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:53:33,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:53:33,433 INFO L87 Difference]: Start difference. First operand 16350 states and 49383 transitions. Second operand 3 states. [2019-12-18 18:53:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:33,671 INFO L93 Difference]: Finished difference Result 16348 states and 49378 transitions. [2019-12-18 18:53:33,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:53:33,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:53:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:33,708 INFO L225 Difference]: With dead ends: 16348 [2019-12-18 18:53:33,709 INFO L226 Difference]: Without dead ends: 16348 [2019-12-18 18:53:33,709 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-18 18:53:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16348 states. [2019-12-18 18:53:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16348 to 14804. [2019-12-18 18:53:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14804 states. [2019-12-18 18:53:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14804 states to 14804 states and 45140 transitions. [2019-12-18 18:53:34,169 INFO L78 Accepts]: Start accepts. Automaton has 14804 states and 45140 transitions. Word has length 54 [2019-12-18 18:53:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:34,170 INFO L462 AbstractCegarLoop]: Abstraction has 14804 states and 45140 transitions. [2019-12-18 18:53:34,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:53:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14804 states and 45140 transitions. [2019-12-18 18:53:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:53:34,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:34,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:53:34,196 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:53:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 1 times [2019-12-18 18:53:34,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:34,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73472569] [2019-12-18 18:53:34,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:53:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:53:34,374 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:53:34,374 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:53:34,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_18|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24|)) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24|) |v_ULTIMATE.start_main_~#t2348~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24| 1)) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2348~0.base_24|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_26|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:53:34,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 18:53:34,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-18 18:53:34,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff0~0_In1863811384 ~x$w_buff1~0_Out1863811384) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1863811384| 1) (= 1 ~x$w_buff0~0_Out1863811384) (= 0 (mod ~x$w_buff1_used~0_Out1863811384 256)) (= 1 ~x$w_buff0_used~0_Out1863811384) (= ~x$w_buff0_used~0_In1863811384 ~x$w_buff1_used~0_Out1863811384) (= P1Thread1of1ForFork0_~arg.offset_Out1863811384 |P1Thread1of1ForFork0_#in~arg.offset_In1863811384|) (= |P1Thread1of1ForFork0_#in~arg.base_In1863811384| P1Thread1of1ForFork0_~arg.base_Out1863811384) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1863811384| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1863811384)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1863811384, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1863811384|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1863811384|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1863811384} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1863811384, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1863811384, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1863811384, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1863811384, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1863811384|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1863811384|, ~x$w_buff1~0=~x$w_buff1~0_Out1863811384, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1863811384|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1863811384, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1863811384} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 18:53:34,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1582780666 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1582780666 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1582780666 |P2Thread1of1ForFork1_#t~ite32_Out1582780666|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1582780666| ~x$w_buff1~0_In1582780666) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1582780666, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1582780666, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1582780666, ~x~0=~x~0_In1582780666} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1582780666|, ~x$w_buff1~0=~x$w_buff1~0_In1582780666, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1582780666, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1582780666, ~x~0=~x~0_In1582780666} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:53:34,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:53:34,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In520298489 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In520298489 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out520298489| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In520298489 |P2Thread1of1ForFork1_#t~ite34_Out520298489|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In520298489, ~x$w_buff0_used~0=~x$w_buff0_used~0_In520298489} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out520298489|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In520298489, ~x$w_buff0_used~0=~x$w_buff0_used~0_In520298489} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:53:34,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1454537952 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1454537952 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1454537952| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1454537952| ~x$w_buff0_used~0_In-1454537952)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1454537952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1454537952} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1454537952, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1454537952|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1454537952} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:53:34,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-569089234 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-569089234 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-569089234 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-569089234 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-569089234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-569089234| ~x$w_buff1_used~0_In-569089234)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-569089234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-569089234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-569089234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-569089234} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-569089234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-569089234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-569089234, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-569089234|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-569089234} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:53:34,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1892150075 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1892150075 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1892150075)) (and (= ~x$r_buff0_thd2~0_In1892150075 ~x$r_buff0_thd2~0_Out1892150075) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1892150075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1892150075} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1892150075|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1892150075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1892150075} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:53:34,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1362074366 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1362074366 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1362074366 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1362074366 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1362074366|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In-1362074366 |P1Thread1of1ForFork0_#t~ite31_Out-1362074366|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1362074366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1362074366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1362074366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1362074366} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1362074366|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1362074366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1362074366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1362074366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1362074366} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:53:34,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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-18 18:53:34,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1266152697 256) 0))) (or (and (= ~x$w_buff1~0_In1266152697 |P0Thread1of1ForFork2_#t~ite11_Out1266152697|) (= |P0Thread1of1ForFork2_#t~ite11_Out1266152697| |P0Thread1of1ForFork2_#t~ite12_Out1266152697|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1266152697 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1266152697 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1266152697 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1266152697 256)))))) (and (= |P0Thread1of1ForFork2_#t~ite11_In1266152697| |P0Thread1of1ForFork2_#t~ite11_Out1266152697|) (not .cse0) (= ~x$w_buff1~0_In1266152697 |P0Thread1of1ForFork2_#t~ite12_Out1266152697|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1266152697, ~x$w_buff1~0=~x$w_buff1~0_In1266152697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1266152697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1266152697, ~weak$$choice2~0=~weak$$choice2~0_In1266152697, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1266152697|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1266152697} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1266152697, ~x$w_buff1~0=~x$w_buff1~0_In1266152697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1266152697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1266152697, ~weak$$choice2~0=~weak$$choice2~0_In1266152697, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1266152697|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1266152697|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1266152697} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 18:53:34,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In740572185 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In740572185 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In740572185 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In740572185 256)) .cse0) (= (mod ~x$w_buff0_used~0_In740572185 256) 0))) (= ~x$w_buff0_used~0_In740572185 |P0Thread1of1ForFork2_#t~ite14_Out740572185|) (= |P0Thread1of1ForFork2_#t~ite15_Out740572185| |P0Thread1of1ForFork2_#t~ite14_Out740572185|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite14_In740572185| |P0Thread1of1ForFork2_#t~ite14_Out740572185|) (not .cse1) (= ~x$w_buff0_used~0_In740572185 |P0Thread1of1ForFork2_#t~ite15_Out740572185|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In740572185, ~x$w_buff1_used~0=~x$w_buff1_used~0_In740572185, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In740572185, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In740572185|, ~weak$$choice2~0=~weak$$choice2~0_In740572185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In740572185} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In740572185, ~x$w_buff1_used~0=~x$w_buff1_used~0_In740572185, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out740572185|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In740572185, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out740572185|, ~weak$$choice2~0=~weak$$choice2~0_In740572185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In740572185} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:53:34,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1944993865 256)))) (or (and (not .cse0) (= ~x$w_buff1_used~0_In1944993865 |P0Thread1of1ForFork2_#t~ite18_Out1944993865|) (= |P0Thread1of1ForFork2_#t~ite17_In1944993865| |P0Thread1of1ForFork2_#t~ite17_Out1944993865|)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out1944993865| |P0Thread1of1ForFork2_#t~ite18_Out1944993865|) (= ~x$w_buff1_used~0_In1944993865 |P0Thread1of1ForFork2_#t~ite17_Out1944993865|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1944993865 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1944993865 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In1944993865 256) 0) .cse1) (and (= (mod ~x$w_buff1_used~0_In1944993865 256) 0) .cse1))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1944993865, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1944993865|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1944993865, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1944993865, ~weak$$choice2~0=~weak$$choice2~0_In1944993865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944993865} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1944993865, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1944993865|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1944993865|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1944993865, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1944993865, ~weak$$choice2~0=~weak$$choice2~0_In1944993865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944993865} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:53:34,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:53:34,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:53:34,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1439055773 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1439055773 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1439055773 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1439055773 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out-1439055773| ~x$w_buff1_used~0_In-1439055773) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1439055773| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1439055773, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1439055773, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1439055773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439055773} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1439055773|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1439055773, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1439055773, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1439055773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1439055773} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:53:34,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In707496418 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In707496418 256)))) (or (and (= ~x$r_buff0_thd3~0_In707496418 |P2Thread1of1ForFork1_#t~ite36_Out707496418|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out707496418|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In707496418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707496418} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out707496418|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In707496418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707496418} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:53:34,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1851209956 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1851209956 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1851209956 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1851209956 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1851209956| ~x$r_buff1_thd3~0_In1851209956) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1851209956| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1851209956, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1851209956, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1851209956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1851209956} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1851209956|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1851209956, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1851209956, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1851209956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1851209956} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:53:34,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 18:53:34,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:53:34,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-582809047 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-582809047 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-582809047| ~x$w_buff1~0_In-582809047) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-582809047| ~x~0_In-582809047)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-582809047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582809047, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-582809047, ~x~0=~x~0_In-582809047} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-582809047|, ~x$w_buff1~0=~x$w_buff1~0_In-582809047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582809047, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-582809047, ~x~0=~x~0_In-582809047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 18:53:34,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 18:53:34,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In107706644 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In107706644 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out107706644| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out107706644| ~x$w_buff0_used~0_In107706644)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In107706644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In107706644} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In107706644, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out107706644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In107706644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:53:34,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1932815650 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1932815650 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1932815650 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1932815650 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1932815650|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1932815650 |ULTIMATE.start_main_#t~ite44_Out-1932815650|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1932815650, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1932815650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1932815650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932815650} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1932815650, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1932815650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1932815650, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1932815650|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932815650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:53:34,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-392479354 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-392479354 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-392479354| ~x$r_buff0_thd0~0_In-392479354)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-392479354|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392479354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392479354} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392479354, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-392479354|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392479354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:53:34,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1232877682 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1232877682 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1232877682 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1232877682 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out1232877682| ~x$r_buff1_thd0~0_In1232877682)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out1232877682| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1232877682, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1232877682, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1232877682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1232877682} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1232877682, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1232877682|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1232877682, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1232877682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1232877682} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:53:34,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:53:34,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:53:34 BasicIcfg [2019-12-18 18:53:34,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:53:34,523 INFO L168 Benchmark]: Toolchain (without parser) took 72169.45 ms. Allocated memory was 143.1 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 99.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 644.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:34,523 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:53:34,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.53 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 98.8 MB in the beginning and 151.5 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:34,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.48 ms. Allocated memory is still 199.8 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:34,529 INFO L168 Benchmark]: Boogie Preprocessor took 39.00 ms. Allocated memory is still 199.8 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:34,530 INFO L168 Benchmark]: RCFGBuilder took 853.42 ms. Allocated memory is still 199.8 MB. Free memory was 146.6 MB in the beginning and 99.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:34,531 INFO L168 Benchmark]: TraceAbstraction took 70368.19 ms. Allocated memory was 199.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 98.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 587.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:34,538 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.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.53 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 98.8 MB in the beginning and 151.5 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.48 ms. Allocated memory is still 199.8 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.00 ms. Allocated memory is still 199.8 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 853.42 ms. Allocated memory is still 199.8 MB. Free memory was 146.6 MB in the beginning and 99.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70368.19 ms. Allocated memory was 199.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 98.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 587.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [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_p2_EAX=0, __unbuffered_p2_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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [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 [L741] 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) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4066 SDtfs, 5019 SDslu, 13949 SDs, 0 SdLazy, 6171 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 42 SyntacticMatches, 15 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 131398 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 879 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 144272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...