/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/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:58:01,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:58:01,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:58:01,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:58:01,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:58:01,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:58:01,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:58:01,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:58:02,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:58:02,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:58:02,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:58:02,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:58:02,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:58:02,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:58:02,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:58:02,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:58:02,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:58:02,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:58:02,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:58:02,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:58:02,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:58:02,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:58:02,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:58:02,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:58:02,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:58:02,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:58:02,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:58:02,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:58:02,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:58:02,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:58:02,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:58:02,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:58:02,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:58:02,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:58:02,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:58:02,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:58:02,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:58:02,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:58:02,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:58:02,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:58:02,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:58:02,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:58:02,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:58:02,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:58:02,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:58:02,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:58:02,062 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:58:02,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:58:02,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:58:02,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:58:02,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:58:02,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:58:02,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:58:02,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:58:02,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:58:02,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:58:02,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:58:02,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:58:02,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:58:02,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:58:02,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:58:02,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:58:02,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:58:02,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:58:02,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:58:02,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:58:02,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:58:02,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:58:02,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:58:02,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:58:02,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:58:02,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:58:02,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:58:02,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:58:02,372 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:58:02,373 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:58:02,373 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-27 02:58:02,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5232ad6/92c8688e861e42e7a6bf6f5fdaa88564/FLAGe450939ac [2019-12-27 02:58:03,072 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:58:03,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-27 02:58:03,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5232ad6/92c8688e861e42e7a6bf6f5fdaa88564/FLAGe450939ac [2019-12-27 02:58:03,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5232ad6/92c8688e861e42e7a6bf6f5fdaa88564 [2019-12-27 02:58:03,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:58:03,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:58:03,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:58:03,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:58:03,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:58:03,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:58:03" (1/1) ... [2019-12-27 02:58:03,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550a67e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:03, skipping insertion in model container [2019-12-27 02:58:03,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:58:03" (1/1) ... [2019-12-27 02:58:03,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:58:03,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:58:03,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:58:03,901 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:58:03,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:58:04,046 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:58:04,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04 WrapperNode [2019-12-27 02:58:04,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:58:04,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:58:04,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:58:04,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:58:04,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:58:04,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:58:04,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:58:04,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:58:04,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... [2019-12-27 02:58:04,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:58:04,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:58:04,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:58:04,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:58:04,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:58:04,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:58:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:58:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:58:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:58:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:58:04,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:58:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:58:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:58:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:58:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:58:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:58:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:58:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:58:04,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:58:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:58:04,232 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:58:05,010 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:58:05,010 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:58:05,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:58:05 BoogieIcfgContainer [2019-12-27 02:58:05,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:58:05,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:58:05,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:58:05,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:58:05,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:58:03" (1/3) ... [2019-12-27 02:58:05,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3e1f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:58:05, skipping insertion in model container [2019-12-27 02:58:05,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:58:04" (2/3) ... [2019-12-27 02:58:05,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3e1f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:58:05, skipping insertion in model container [2019-12-27 02:58:05,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:58:05" (3/3) ... [2019-12-27 02:58:05,023 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2019-12-27 02:58:05,034 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:58:05,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:58:05,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:58:05,052 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:58:05,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,096 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,099 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,099 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,107 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,107 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,108 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,108 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,109 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,110 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,110 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,110 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,110 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,111 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,111 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,111 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,111 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,111 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,112 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,131 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,132 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,133 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,133 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,133 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,133 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,145 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,146 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,155 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,155 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,157 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,157 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,158 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:58:05,177 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:58:05,194 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:58:05,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:58:05,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:58:05,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:58:05,195 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:58:05,195 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:58:05,195 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:58:05,195 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:58:05,218 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-27 02:58:05,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 02:58:05,347 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 02:58:05,347 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:58:05,366 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:58:05,383 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 02:58:05,480 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 02:58:05,480 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:58:05,490 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:58:05,509 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 02:58:05,510 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:58:10,718 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:58:10,852 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:58:10,879 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50860 [2019-12-27 02:58:10,879 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 02:58:10,883 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 97 transitions [2019-12-27 02:58:12,973 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-27 02:58:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-27 02:58:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:58:12,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:12,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:12,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1893967926, now seen corresponding path program 1 times [2019-12-27 02:58:12,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:12,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255735818] [2019-12-27 02:58:12,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:13,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255735818] [2019-12-27 02:58:13,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:13,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:58:13,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259223507] [2019-12-27 02:58:13,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:58:13,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:58:13,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:13,367 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-27 02:58:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:14,913 INFO L93 Difference]: Finished difference Result 34366 states and 145832 transitions. [2019-12-27 02:58:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:58:14,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:58:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:15,306 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 02:58:15,306 INFO L226 Difference]: Without dead ends: 33694 [2019-12-27 02:58:15,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-27 02:58:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-27 02:58:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-27 02:58:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 143088 transitions. [2019-12-27 02:58:18,443 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 143088 transitions. Word has length 9 [2019-12-27 02:58:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:18,444 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 143088 transitions. [2019-12-27 02:58:18,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:58:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 143088 transitions. [2019-12-27 02:58:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:58:18,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:18,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:18,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:18,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 706074371, now seen corresponding path program 1 times [2019-12-27 02:58:18,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:18,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715155591] [2019-12-27 02:58:18,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:18,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715155591] [2019-12-27 02:58:18,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:18,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:58:18,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452306966] [2019-12-27 02:58:18,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:58:18,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:58:18,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:58:18,618 INFO L87 Difference]: Start difference. First operand 33694 states and 143088 transitions. Second operand 4 states. [2019-12-27 02:58:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:20,002 INFO L93 Difference]: Finished difference Result 52350 states and 214840 transitions. [2019-12-27 02:58:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:58:20,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:58:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:20,290 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 02:58:20,291 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 02:58:20,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:58:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 02:58:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47546. [2019-12-27 02:58:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47546 states. [2019-12-27 02:58:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47546 states to 47546 states and 197076 transitions. [2019-12-27 02:58:22,171 INFO L78 Accepts]: Start accepts. Automaton has 47546 states and 197076 transitions. Word has length 15 [2019-12-27 02:58:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:22,171 INFO L462 AbstractCegarLoop]: Abstraction has 47546 states and 197076 transitions. [2019-12-27 02:58:22,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:58:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 47546 states and 197076 transitions. [2019-12-27 02:58:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:58:22,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:22,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:22,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1899832342, now seen corresponding path program 1 times [2019-12-27 02:58:22,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:22,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133952196] [2019-12-27 02:58:22,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:22,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133952196] [2019-12-27 02:58:22,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:22,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:58:22,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581161564] [2019-12-27 02:58:22,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:58:22,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:58:22,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:58:22,244 INFO L87 Difference]: Start difference. First operand 47546 states and 197076 transitions. Second operand 4 states. [2019-12-27 02:58:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:24,364 INFO L93 Difference]: Finished difference Result 58566 states and 240916 transitions. [2019-12-27 02:58:24,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:58:24,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:58:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:24,599 INFO L225 Difference]: With dead ends: 58566 [2019-12-27 02:58:24,599 INFO L226 Difference]: Without dead ends: 58566 [2019-12-27 02:58:24,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:58:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2019-12-27 02:58:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 52262. [2019-12-27 02:58:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52262 states. [2019-12-27 02:58:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52262 states to 52262 states and 216300 transitions. [2019-12-27 02:58:26,933 INFO L78 Accepts]: Start accepts. Automaton has 52262 states and 216300 transitions. Word has length 15 [2019-12-27 02:58:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:26,933 INFO L462 AbstractCegarLoop]: Abstraction has 52262 states and 216300 transitions. [2019-12-27 02:58:26,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:58:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 52262 states and 216300 transitions. [2019-12-27 02:58:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:58:26,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:26,950 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] [2019-12-27 02:58:26,950 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1099673125, now seen corresponding path program 1 times [2019-12-27 02:58:26,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:26,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515193313] [2019-12-27 02:58:26,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:27,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515193313] [2019-12-27 02:58:27,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:27,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:58:27,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554109755] [2019-12-27 02:58:27,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:58:27,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:27,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:58:27,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:58:27,031 INFO L87 Difference]: Start difference. First operand 52262 states and 216300 transitions. Second operand 4 states. [2019-12-27 02:58:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:27,270 INFO L93 Difference]: Finished difference Result 41984 states and 159713 transitions. [2019-12-27 02:58:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:58:27,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-27 02:58:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:27,379 INFO L225 Difference]: With dead ends: 41984 [2019-12-27 02:58:27,379 INFO L226 Difference]: Without dead ends: 40876 [2019-12-27 02:58:27,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:58:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-12-27 02:58:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 40876. [2019-12-27 02:58:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40876 states. [2019-12-27 02:58:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40876 states to 40876 states and 156237 transitions. [2019-12-27 02:58:30,491 INFO L78 Accepts]: Start accepts. Automaton has 40876 states and 156237 transitions. Word has length 21 [2019-12-27 02:58:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:30,491 INFO L462 AbstractCegarLoop]: Abstraction has 40876 states and 156237 transitions. [2019-12-27 02:58:30,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:58:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40876 states and 156237 transitions. [2019-12-27 02:58:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:58:30,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:30,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:30,504 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash 637645513, now seen corresponding path program 1 times [2019-12-27 02:58:30,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:30,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450746713] [2019-12-27 02:58:30,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:30,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-27 02:58:30,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450746713] [2019-12-27 02:58:30,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:30,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:58:30,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723189622] [2019-12-27 02:58:30,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:58:30,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:58:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:58:30,606 INFO L87 Difference]: Start difference. First operand 40876 states and 156237 transitions. Second operand 5 states. [2019-12-27 02:58:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:31,621 INFO L93 Difference]: Finished difference Result 54396 states and 204140 transitions. [2019-12-27 02:58:31,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:58:31,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:58:31,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:31,743 INFO L225 Difference]: With dead ends: 54396 [2019-12-27 02:58:31,743 INFO L226 Difference]: Without dead ends: 54375 [2019-12-27 02:58:31,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:58:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54375 states. [2019-12-27 02:58:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54375 to 41122. [2019-12-27 02:58:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41122 states. [2019-12-27 02:58:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41122 states to 41122 states and 156869 transitions. [2019-12-27 02:58:34,774 INFO L78 Accepts]: Start accepts. Automaton has 41122 states and 156869 transitions. Word has length 22 [2019-12-27 02:58:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:34,774 INFO L462 AbstractCegarLoop]: Abstraction has 41122 states and 156869 transitions. [2019-12-27 02:58:34,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:58:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 41122 states and 156869 transitions. [2019-12-27 02:58:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 02:58:34,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:34,808 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] [2019-12-27 02:58:34,808 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:34,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2027557007, now seen corresponding path program 1 times [2019-12-27 02:58:34,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:34,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080255453] [2019-12-27 02:58:34,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:34,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080255453] [2019-12-27 02:58:34,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:34,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:58:34,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636106877] [2019-12-27 02:58:34,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:58:34,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:34,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:58:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:34,862 INFO L87 Difference]: Start difference. First operand 41122 states and 156869 transitions. Second operand 3 states. [2019-12-27 02:58:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:35,121 INFO L93 Difference]: Finished difference Result 51974 states and 196153 transitions. [2019-12-27 02:58:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:58:35,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 02:58:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:35,235 INFO L225 Difference]: With dead ends: 51974 [2019-12-27 02:58:35,236 INFO L226 Difference]: Without dead ends: 51974 [2019-12-27 02:58:35,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51974 states. [2019-12-27 02:58:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51974 to 45309. [2019-12-27 02:58:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45309 states. [2019-12-27 02:58:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45309 states to 45309 states and 172388 transitions. [2019-12-27 02:58:36,514 INFO L78 Accepts]: Start accepts. Automaton has 45309 states and 172388 transitions. Word has length 30 [2019-12-27 02:58:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:36,514 INFO L462 AbstractCegarLoop]: Abstraction has 45309 states and 172388 transitions. [2019-12-27 02:58:36,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:58:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 45309 states and 172388 transitions. [2019-12-27 02:58:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 02:58:36,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:36,542 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] [2019-12-27 02:58:36,542 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2027793723, now seen corresponding path program 1 times [2019-12-27 02:58:36,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:36,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591719837] [2019-12-27 02:58:36,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:36,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591719837] [2019-12-27 02:58:36,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:36,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:58:36,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110055371] [2019-12-27 02:58:36,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:58:36,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:58:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:58:36,628 INFO L87 Difference]: Start difference. First operand 45309 states and 172388 transitions. Second operand 5 states. [2019-12-27 02:58:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:36,739 INFO L93 Difference]: Finished difference Result 19765 states and 62245 transitions. [2019-12-27 02:58:36,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:58:36,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 02:58:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:36,766 INFO L225 Difference]: With dead ends: 19765 [2019-12-27 02:58:36,767 INFO L226 Difference]: Without dead ends: 18889 [2019-12-27 02:58:36,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:58:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2019-12-27 02:58:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 18889. [2019-12-27 02:58:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18889 states. [2019-12-27 02:58:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18889 states to 18889 states and 59447 transitions. [2019-12-27 02:58:37,046 INFO L78 Accepts]: Start accepts. Automaton has 18889 states and 59447 transitions. Word has length 30 [2019-12-27 02:58:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:37,046 INFO L462 AbstractCegarLoop]: Abstraction has 18889 states and 59447 transitions. [2019-12-27 02:58:37,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:58:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 18889 states and 59447 transitions. [2019-12-27 02:58:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 02:58:37,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:37,504 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] [2019-12-27 02:58:37,504 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1945851485, now seen corresponding path program 1 times [2019-12-27 02:58:37,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:37,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156277708] [2019-12-27 02:58:37,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:37,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156277708] [2019-12-27 02:58:37,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:37,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:58:37,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486716077] [2019-12-27 02:58:37,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:58:37,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:37,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:58:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:58:37,607 INFO L87 Difference]: Start difference. First operand 18889 states and 59447 transitions. Second operand 6 states. [2019-12-27 02:58:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:37,691 INFO L93 Difference]: Finished difference Result 3470 states and 8793 transitions. [2019-12-27 02:58:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:58:37,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 02:58:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:37,695 INFO L225 Difference]: With dead ends: 3470 [2019-12-27 02:58:37,695 INFO L226 Difference]: Without dead ends: 3101 [2019-12-27 02:58:37,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:58:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-27 02:58:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 3101. [2019-12-27 02:58:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2019-12-27 02:58:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7755 transitions. [2019-12-27 02:58:37,727 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7755 transitions. Word has length 31 [2019-12-27 02:58:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:37,727 INFO L462 AbstractCegarLoop]: Abstraction has 3101 states and 7755 transitions. [2019-12-27 02:58:37,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:58:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7755 transitions. [2019-12-27 02:58:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 02:58:37,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:37,731 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] [2019-12-27 02:58:37,731 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:37,731 INFO L82 PathProgramCache]: Analyzing trace with hash -476238483, now seen corresponding path program 1 times [2019-12-27 02:58:37,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:37,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000184342] [2019-12-27 02:58:37,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:37,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000184342] [2019-12-27 02:58:37,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:37,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:58:37,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065226344] [2019-12-27 02:58:37,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:58:37,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:58:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:58:37,846 INFO L87 Difference]: Start difference. First operand 3101 states and 7755 transitions. Second operand 7 states. [2019-12-27 02:58:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:37,946 INFO L93 Difference]: Finished difference Result 1342 states and 3750 transitions. [2019-12-27 02:58:37,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:58:37,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-27 02:58:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:37,950 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 02:58:37,950 INFO L226 Difference]: Without dead ends: 1293 [2019-12-27 02:58:37,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:58:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-12-27 02:58:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1181. [2019-12-27 02:58:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-27 02:58:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3334 transitions. [2019-12-27 02:58:37,963 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3334 transitions. Word has length 43 [2019-12-27 02:58:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:37,964 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 3334 transitions. [2019-12-27 02:58:37,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:58:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3334 transitions. [2019-12-27 02:58:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:58:37,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:37,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:37,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:37,967 INFO L82 PathProgramCache]: Analyzing trace with hash -409088440, now seen corresponding path program 1 times [2019-12-27 02:58:37,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:37,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506954963] [2019-12-27 02:58:37,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:38,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506954963] [2019-12-27 02:58:38,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:38,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:58:38,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474793239] [2019-12-27 02:58:38,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:58:38,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:58:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:58:38,071 INFO L87 Difference]: Start difference. First operand 1181 states and 3334 transitions. Second operand 5 states. [2019-12-27 02:58:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:38,326 INFO L93 Difference]: Finished difference Result 1666 states and 4696 transitions. [2019-12-27 02:58:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:58:38,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 02:58:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:38,330 INFO L225 Difference]: With dead ends: 1666 [2019-12-27 02:58:38,331 INFO L226 Difference]: Without dead ends: 1666 [2019-12-27 02:58:38,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:58:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-27 02:58:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1470. [2019-12-27 02:58:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1470 states. [2019-12-27 02:58:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4144 transitions. [2019-12-27 02:58:38,364 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4144 transitions. Word has length 58 [2019-12-27 02:58:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:38,364 INFO L462 AbstractCegarLoop]: Abstraction has 1470 states and 4144 transitions. [2019-12-27 02:58:38,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:58:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4144 transitions. [2019-12-27 02:58:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:58:38,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:38,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:38,369 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2087231872, now seen corresponding path program 2 times [2019-12-27 02:58:38,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:38,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857300249] [2019-12-27 02:58:38,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:38,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857300249] [2019-12-27 02:58:38,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:38,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:58:38,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693281544] [2019-12-27 02:58:38,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:58:38,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:38,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:58:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:58:38,487 INFO L87 Difference]: Start difference. First operand 1470 states and 4144 transitions. Second operand 6 states. [2019-12-27 02:58:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:38,855 INFO L93 Difference]: Finished difference Result 1745 states and 4788 transitions. [2019-12-27 02:58:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:58:38,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 02:58:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:38,858 INFO L225 Difference]: With dead ends: 1745 [2019-12-27 02:58:38,858 INFO L226 Difference]: Without dead ends: 1745 [2019-12-27 02:58:38,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:58:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-12-27 02:58:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1522. [2019-12-27 02:58:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-12-27 02:58:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 4220 transitions. [2019-12-27 02:58:38,884 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 4220 transitions. Word has length 58 [2019-12-27 02:58:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:38,884 INFO L462 AbstractCegarLoop]: Abstraction has 1522 states and 4220 transitions. [2019-12-27 02:58:38,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:58:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 4220 transitions. [2019-12-27 02:58:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:58:38,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:38,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:38,888 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:38,888 INFO L82 PathProgramCache]: Analyzing trace with hash -893148506, now seen corresponding path program 3 times [2019-12-27 02:58:38,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:38,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366330459] [2019-12-27 02:58:38,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:38,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366330459] [2019-12-27 02:58:38,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:38,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:58:38,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274485029] [2019-12-27 02:58:38,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:58:38,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:58:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:38,958 INFO L87 Difference]: Start difference. First operand 1522 states and 4220 transitions. Second operand 3 states. [2019-12-27 02:58:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:38,973 INFO L93 Difference]: Finished difference Result 1414 states and 3884 transitions. [2019-12-27 02:58:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:58:38,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 02:58:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:38,976 INFO L225 Difference]: With dead ends: 1414 [2019-12-27 02:58:38,976 INFO L226 Difference]: Without dead ends: 1414 [2019-12-27 02:58:38,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-27 02:58:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2019-12-27 02:58:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-27 02:58:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 3884 transitions. [2019-12-27 02:58:38,998 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 3884 transitions. Word has length 58 [2019-12-27 02:58:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:38,998 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 3884 transitions. [2019-12-27 02:58:38,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:58:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 3884 transitions. [2019-12-27 02:58:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:58:39,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:39,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:39,002 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash -465324325, now seen corresponding path program 1 times [2019-12-27 02:58:39,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:39,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506914394] [2019-12-27 02:58:39,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:39,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506914394] [2019-12-27 02:58:39,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:39,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:58:39,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699937440] [2019-12-27 02:58:39,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:58:39,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:58:39,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:39,095 INFO L87 Difference]: Start difference. First operand 1414 states and 3884 transitions. Second operand 3 states. [2019-12-27 02:58:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:39,149 INFO L93 Difference]: Finished difference Result 1413 states and 3882 transitions. [2019-12-27 02:58:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:58:39,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 02:58:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:39,153 INFO L225 Difference]: With dead ends: 1413 [2019-12-27 02:58:39,153 INFO L226 Difference]: Without dead ends: 1413 [2019-12-27 02:58:39,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:58:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-27 02:58:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1160. [2019-12-27 02:58:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-12-27 02:58:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 3188 transitions. [2019-12-27 02:58:39,174 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 3188 transitions. Word has length 59 [2019-12-27 02:58:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:39,174 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 3188 transitions. [2019-12-27 02:58:39,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:58:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 3188 transitions. [2019-12-27 02:58:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:58:39,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:39,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:39,177 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1056994783, now seen corresponding path program 1 times [2019-12-27 02:58:39,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:39,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708698615] [2019-12-27 02:58:39,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:39,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708698615] [2019-12-27 02:58:39,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:39,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:58:39,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146734867] [2019-12-27 02:58:39,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:58:39,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:39,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:58:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:58:39,385 INFO L87 Difference]: Start difference. First operand 1160 states and 3188 transitions. Second operand 10 states. [2019-12-27 02:58:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:39,713 INFO L93 Difference]: Finished difference Result 2229 states and 5665 transitions. [2019-12-27 02:58:39,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:58:39,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-27 02:58:39,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:39,717 INFO L225 Difference]: With dead ends: 2229 [2019-12-27 02:58:39,717 INFO L226 Difference]: Without dead ends: 1480 [2019-12-27 02:58:39,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:58:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-12-27 02:58:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1020. [2019-12-27 02:58:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-12-27 02:58:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2717 transitions. [2019-12-27 02:58:39,737 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2717 transitions. Word has length 60 [2019-12-27 02:58:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:39,737 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 2717 transitions. [2019-12-27 02:58:39,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:58:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2717 transitions. [2019-12-27 02:58:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:58:39,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:39,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:39,741 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1968443931, now seen corresponding path program 2 times [2019-12-27 02:58:39,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:39,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066351290] [2019-12-27 02:58:39,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:39,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066351290] [2019-12-27 02:58:39,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:39,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:58:39,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888458357] [2019-12-27 02:58:39,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:58:39,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:39,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:58:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:58:39,914 INFO L87 Difference]: Start difference. First operand 1020 states and 2717 transitions. Second operand 7 states. [2019-12-27 02:58:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:40,036 INFO L93 Difference]: Finished difference Result 1960 states and 4866 transitions. [2019-12-27 02:58:40,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:58:40,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 02:58:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:40,039 INFO L225 Difference]: With dead ends: 1960 [2019-12-27 02:58:40,039 INFO L226 Difference]: Without dead ends: 796 [2019-12-27 02:58:40,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:58:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-27 02:58:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 571. [2019-12-27 02:58:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-27 02:58:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1223 transitions. [2019-12-27 02:58:40,049 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1223 transitions. Word has length 60 [2019-12-27 02:58:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:40,049 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1223 transitions. [2019-12-27 02:58:40,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:58:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1223 transitions. [2019-12-27 02:58:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:58:40,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:40,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:40,050 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1222711449, now seen corresponding path program 3 times [2019-12-27 02:58:40,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:40,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137302700] [2019-12-27 02:58:40,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:40,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137302700] [2019-12-27 02:58:40,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:40,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:58:40,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354603444] [2019-12-27 02:58:40,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:58:40,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:58:40,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:58:40,183 INFO L87 Difference]: Start difference. First operand 571 states and 1223 transitions. Second operand 6 states. [2019-12-27 02:58:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:40,266 INFO L93 Difference]: Finished difference Result 809 states and 1670 transitions. [2019-12-27 02:58:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:58:40,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 02:58:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:40,267 INFO L225 Difference]: With dead ends: 809 [2019-12-27 02:58:40,267 INFO L226 Difference]: Without dead ends: 239 [2019-12-27 02:58:40,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:58:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-12-27 02:58:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2019-12-27 02:58:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-27 02:58:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 364 transitions. [2019-12-27 02:58:40,272 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 364 transitions. Word has length 60 [2019-12-27 02:58:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:40,272 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 364 transitions. [2019-12-27 02:58:40,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:58:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 364 transitions. [2019-12-27 02:58:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:58:40,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:40,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:40,274 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 424334393, now seen corresponding path program 4 times [2019-12-27 02:58:40,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:40,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607034592] [2019-12-27 02:58:40,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:58:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:58:40,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607034592] [2019-12-27 02:58:40,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:58:40,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:58:40,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923831267] [2019-12-27 02:58:40,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:58:40,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:58:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:58:40,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:58:40,514 INFO L87 Difference]: Start difference. First operand 215 states and 364 transitions. Second operand 12 states. [2019-12-27 02:58:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:58:40,916 INFO L93 Difference]: Finished difference Result 366 states and 609 transitions. [2019-12-27 02:58:40,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:58:40,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 02:58:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:58:40,917 INFO L225 Difference]: With dead ends: 366 [2019-12-27 02:58:40,917 INFO L226 Difference]: Without dead ends: 333 [2019-12-27 02:58:40,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:58:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-27 02:58:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2019-12-27 02:58:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-27 02:58:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-12-27 02:58:40,923 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 60 [2019-12-27 02:58:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:58:40,924 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-12-27 02:58:40,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:58:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-12-27 02:58:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:58:40,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:58:40,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:58:40,925 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:58:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:58:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1750352957, now seen corresponding path program 5 times [2019-12-27 02:58:40,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:58:40,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117355558] [2019-12-27 02:58:40,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:58:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:58:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:58:41,127 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:58:41,128 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:58:41,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t1477~0.base_22| 4) |v_#length_31|) (= v_~z$w_buff0~0_106 0) (= v_~z$r_buff0_thd2~0_89 0) (= v_~main$tmp_guard0~0_30 0) (= 0 |v_ULTIMATE.start_main_~#t1477~0.offset_17|) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd1~0_90) (< 0 |v_#StackHeapBarrier_21|) (= v_~a~0_108 0) (= v_~z$w_buff0_used~0_517 0) (= v_~z$r_buff0_thd0~0_321 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22|) |v_ULTIMATE.start_main_~#t1477~0.offset_17| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_244 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22|) 0) (= 0 v_~z$w_buff1~0_99) (= 0 |v_#NULL.base_6|) (= 0 v_~z$r_buff1_thd2~0_90) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$flush_delayed~0_47) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_147) (= 0 v_~z$r_buff1_thd4~0_142) (= 0 v_~z$r_buff1_thd3~0_154) (= 0 v_~weak$$choice0~0_24) (= v_~__unbuffered_cnt~0_141 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1477~0.base_22|) (= v_~z$w_buff1_used~0_308 0) (= 0 v_~__unbuffered_p3_EAX~0_99) (= v_~weak$$choice2~0_108 0) (= v_~z$r_buff0_thd1~0_89 0) (= 0 v_~z$r_buff0_thd4~0_241) (= v_~z~0_160 0) (= v_~z$mem_tmp~0_28 0) (= v_~y~0_41 0) (= v_~x~0_54 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22| 1)) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_33|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_16|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_90, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_55|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_30|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_19|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|, ~a~0=v_~a~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_321, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_241, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_99, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_28, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_96|, ULTIMATE.start_main_~#t1477~0.base=|v_ULTIMATE.start_main_~#t1477~0.base_22|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ~z$flush_delayed~0=v_~z$flush_delayed~0_47, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_33|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_32|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_141|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_90, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_54, ULTIMATE.start_main_~#t1477~0.offset=|v_ULTIMATE.start_main_~#t1477~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_142, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_99, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_29|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_105|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_23|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_41|, ~y~0=v_~y~0_41, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_20|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_106, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_31|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_91|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_30|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_18|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1480~0.offset, ULTIMATE.start_main_~#t1479~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1477~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1477~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1478~0.base, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1480~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1479~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1478~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:58:41,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1478~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13|) |v_ULTIMATE.start_main_~#t1478~0.offset_11| 1)) |v_#memory_int_19|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t1478~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1478~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1478~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1478~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1478~0.offset, #length] because there is no mapped edge [2019-12-27 02:58:41,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1479~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1479~0.base_10| 4) |v_#length_19|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10| 1)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1479~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1479~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10|) |v_ULTIMATE.start_main_~#t1479~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1479~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1479~0.offset, #length] because there is no mapped edge [2019-12-27 02:58:41,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-1-->L829: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1480~0.base_11|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1480~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1480~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1480~0.offset_10| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11|) |v_ULTIMATE.start_main_~#t1480~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_10|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1480~0.base, ULTIMATE.start_main_~#t1480~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 02:58:41,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L4-->L800: Formula: (and (= ~z$r_buff1_thd2~0_Out-1896660012 ~z$r_buff0_thd2~0_In-1896660012) (= ~z$r_buff0_thd1~0_In-1896660012 ~z$r_buff1_thd1~0_Out-1896660012) (= ~z$r_buff0_thd0~0_In-1896660012 ~z$r_buff1_thd0~0_Out-1896660012) (= ~z$r_buff1_thd3~0_Out-1896660012 ~z$r_buff0_thd3~0_In-1896660012) (= 1 ~z$r_buff0_thd4~0_Out-1896660012) (= ~__unbuffered_p3_EAX~0_Out-1896660012 ~a~0_In-1896660012) (= ~z$r_buff0_thd4~0_In-1896660012 ~z$r_buff1_thd4~0_Out-1896660012) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1896660012 0))) InVars {~a~0=~a~0_In-1896660012, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1896660012, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1896660012, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1896660012, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1896660012, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1896660012, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1896660012} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1896660012, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1896660012, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1896660012, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1896660012, ~a~0=~a~0_In-1896660012, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1896660012, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1896660012, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1896660012, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1896660012, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1896660012, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1896660012, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1896660012, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1896660012} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:58:41,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~x~0_32 1) (= v_~a~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_32, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:58:41,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= v_~x~0_41 2) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, ~y~0=v_~y~0_32, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:58:41,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-2010854412 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2010854412 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-2010854412| ~z$w_buff0_used~0_In-2010854412) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-2010854412| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2010854412, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2010854412} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2010854412, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2010854412, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-2010854412|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 02:58:41,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In140031464 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In140031464 256)))) (or (and (= ~z$w_buff1~0_In140031464 |P2Thread1of1ForFork2_#t~ite3_Out140031464|) (not .cse0) (not .cse1)) (and (= ~z~0_In140031464 |P2Thread1of1ForFork2_#t~ite3_Out140031464|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In140031464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In140031464, ~z$w_buff1~0=~z$w_buff1~0_In140031464, ~z~0=~z~0_In140031464} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out140031464|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In140031464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In140031464, ~z$w_buff1~0=~z$w_buff1~0_In140031464, ~z~0=~z~0_In140031464} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:58:41,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_14| v_~z~0_35) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_14|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_13|, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 02:58:41,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1718050993 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1718050993 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1718050993 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1718050993 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1718050993 |P3Thread1of1ForFork3_#t~ite12_Out-1718050993|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1718050993|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1718050993, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1718050993, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1718050993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1718050993} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1718050993, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1718050993, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1718050993, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1718050993, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1718050993|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 02:58:41,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1329945443 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1329945443 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out1329945443 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out1329945443 ~z$r_buff0_thd4~0_In1329945443) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1329945443, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1329945443} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1329945443, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1329945443, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1329945443|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 02:58:41,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1469366066 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1469366066 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1469366066 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1469366066 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1469366066|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In-1469366066 |P3Thread1of1ForFork3_#t~ite14_Out-1469366066|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1469366066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1469366066, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1469366066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1469366066} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1469366066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1469366066, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1469366066|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1469366066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1469366066} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 02:58:41,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L804-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_84)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_84, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 02:58:41,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1739324844 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1739324844 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1739324844 |P2Thread1of1ForFork2_#t~ite5_Out-1739324844|)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1739324844| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739324844, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1739324844} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1739324844|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739324844, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1739324844} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:58:41,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2078608466 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2078608466 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-2078608466 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2078608466 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-2078608466| ~z$w_buff1_used~0_In-2078608466) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-2078608466|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078608466, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2078608466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078608466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2078608466} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-2078608466|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078608466, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2078608466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078608466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2078608466} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:58:41,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1317784616 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1317784616 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1317784616|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1317784616| ~z$r_buff0_thd3~0_In-1317784616) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1317784616, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1317784616} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1317784616, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1317784616, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1317784616|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:58:41,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In577175702 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In577175702 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In577175702 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In577175702 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out577175702| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite8_Out577175702| ~z$r_buff1_thd3~0_In577175702)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In577175702, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In577175702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In577175702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In577175702} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In577175702, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In577175702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In577175702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In577175702, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out577175702|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:58:41,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_126) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:58:41,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_104 256)) (= (mod v_~z$r_buff0_thd0~0_62 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:58:41,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-701065747 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-701065747 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-701065747| ~z$w_buff1~0_In-701065747)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-701065747| ~z~0_In-701065747)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-701065747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-701065747, ~z$w_buff1~0=~z$w_buff1~0_In-701065747, ~z~0=~z~0_In-701065747} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-701065747|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-701065747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-701065747, ~z$w_buff1~0=~z$w_buff1~0_In-701065747, ~z~0=~z~0_In-701065747} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 02:58:41,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_32 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_32, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:58:41,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-478504219 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-478504219 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-478504219| ~z$w_buff0_used~0_In-478504219)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-478504219|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-478504219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-478504219} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-478504219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-478504219, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-478504219|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:58:41,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1549000139 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1549000139 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1549000139 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1549000139 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1549000139 |ULTIMATE.start_main_#t~ite22_Out-1549000139|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1549000139|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1549000139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549000139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1549000139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549000139} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1549000139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549000139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1549000139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549000139, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1549000139|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:58:41,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-211866268 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-211866268 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-211866268 |ULTIMATE.start_main_#t~ite23_Out-211866268|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-211866268| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-211866268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-211866268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-211866268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-211866268, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-211866268|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:58:41,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-990308971 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-990308971 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-990308971 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-990308971 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-990308971|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-990308971 |ULTIMATE.start_main_#t~ite24_Out-990308971|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-990308971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-990308971, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-990308971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-990308971} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-990308971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-990308971, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-990308971, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-990308971|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-990308971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 02:58:41,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L848-->L848-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1643658247 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out1643658247| ~z$w_buff1~0_In1643658247) (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In1643658247| |ULTIMATE.start_main_#t~ite33_Out1643658247|)) (and (= |ULTIMATE.start_main_#t~ite33_Out1643658247| ~z$w_buff1~0_In1643658247) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1643658247 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1643658247 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In1643658247 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1643658247 256)))) .cse0 (= |ULTIMATE.start_main_#t~ite33_Out1643658247| |ULTIMATE.start_main_#t~ite34_Out1643658247|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1643658247, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1643658247, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1643658247, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1643658247, ~z$w_buff1~0=~z$w_buff1~0_In1643658247, ~weak$$choice2~0=~weak$$choice2~0_In1643658247, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1643658247|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1643658247, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1643658247, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1643658247, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1643658247, ~z$w_buff1~0=~z$w_buff1~0_In1643658247, ~weak$$choice2~0=~weak$$choice2~0_In1643658247, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1643658247|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1643658247|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 02:58:41,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-->L850-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1984509937 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1984509937| |ULTIMATE.start_main_#t~ite40_Out-1984509937|) (= |ULTIMATE.start_main_#t~ite39_Out-1984509937| ~z$w_buff1_used~0_In-1984509937) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1984509937 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1984509937 256))) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1984509937 256))) (= 0 (mod ~z$w_buff0_used~0_In-1984509937 256)))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_In-1984509937| |ULTIMATE.start_main_#t~ite39_Out-1984509937|) (= |ULTIMATE.start_main_#t~ite40_Out-1984509937| ~z$w_buff1_used~0_In-1984509937)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1984509937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1984509937, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1984509937|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1984509937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1984509937, ~weak$$choice2~0=~weak$$choice2~0_In-1984509937} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1984509937, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1984509937|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1984509937|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1984509937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1984509937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1984509937, ~weak$$choice2~0=~weak$$choice2~0_In-1984509937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:58:41,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (= v_~z$r_buff0_thd0~0_135 v_~z$r_buff0_thd0~0_134) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_41, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:58:41,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L852-->L852-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1125965908 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_In1125965908| |ULTIMATE.start_main_#t~ite45_Out1125965908|) (= |ULTIMATE.start_main_#t~ite46_Out1125965908| ~z$r_buff1_thd0~0_In1125965908) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1125965908 256)))) (or (= (mod ~z$w_buff0_used~0_In1125965908 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1125965908 256))) (and (= 0 (mod ~z$w_buff1_used~0_In1125965908 256)) .cse1))) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out1125965908| |ULTIMATE.start_main_#t~ite46_Out1125965908|) (= |ULTIMATE.start_main_#t~ite45_Out1125965908| ~z$r_buff1_thd0~0_In1125965908)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1125965908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1125965908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1125965908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1125965908, ~weak$$choice2~0=~weak$$choice2~0_In1125965908, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1125965908|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1125965908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1125965908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1125965908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1125965908, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1125965908|, ~weak$$choice2~0=~weak$$choice2~0_In1125965908, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1125965908|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:58:41,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_38) (not (= (mod v_~z$flush_delayed~0_39 256) 0)) (= v_~z$mem_tmp~0_25 v_~z~0_127) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_12 256))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_39} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_25, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_38, ~z~0=v_~z~0_127, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:58:41,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:58:41,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:58:41 BasicIcfg [2019-12-27 02:58:41,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:58:41,302 INFO L168 Benchmark]: Toolchain (without parser) took 38027.06 ms. Allocated memory was 138.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.0 MB in the beginning and 395.0 MB in the end (delta: -293.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 02:58:41,303 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:58:41,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.24 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:58:41,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.77 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:58:41,307 INFO L168 Benchmark]: Boogie Preprocessor took 37.91 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:58:41,308 INFO L168 Benchmark]: RCFGBuilder took 850.98 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 102.8 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:58:41,309 INFO L168 Benchmark]: TraceAbstraction took 36281.22 ms. Allocated memory was 203.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.2 MB in the beginning and 395.0 MB in the end (delta: -292.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 02:58:41,318 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.24 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.77 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.91 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.98 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 102.8 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36281.22 ms. Allocated memory was 203.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.2 MB in the beginning and 395.0 MB in the end (delta: -292.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 4846 VarBasedMoverChecksPositive, 179 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 208 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50860 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1978 SDtfs, 2321 SDslu, 4470 SDs, 0 SdLazy, 1701 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52262occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 32501 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 127064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...