/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:23:35,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:23:35,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:23:35,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:23:35,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:23:35,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:23:35,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:23:35,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:23:35,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:23:35,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:23:35,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:23:35,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:23:35,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:23:35,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:23:35,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:23:35,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:23:35,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:23:35,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:23:35,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:23:35,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:23:35,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:23:35,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:23:35,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:23:35,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:23:35,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:23:35,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:23:35,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:23:35,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:23:35,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:23:35,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:23:35,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:23:35,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:23:35,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:23:35,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:23:35,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:23:35,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:23:35,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:23:35,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:23:35,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:23:35,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:23:35,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:23:35,179 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-VariableLbe-MCR.epf [2019-12-27 21:23:35,193 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:23:35,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:23:35,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:23:35,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:23:35,195 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:23:35,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:23:35,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:23:35,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:23:35,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:23:35,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:23:35,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:23:35,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:23:35,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:23:35,197 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:23:35,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:23:35,197 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:23:35,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:23:35,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:23:35,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:23:35,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:23:35,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:23:35,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:23:35,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:23:35,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:23:35,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:23:35,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:23:35,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:23:35,200 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:23:35,200 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:23:35,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:23:35,200 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:23:35,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:23:35,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:23:35,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:23:35,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:23:35,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:23:35,507 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:23:35,508 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-27 21:23:35,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b132ed34c/81cee70928334976952a10c7bc9980f7/FLAG5e3317361 [2019-12-27 21:23:36,179 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:23:36,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-27 21:23:36,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b132ed34c/81cee70928334976952a10c7bc9980f7/FLAG5e3317361 [2019-12-27 21:23:36,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b132ed34c/81cee70928334976952a10c7bc9980f7 [2019-12-27 21:23:36,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:23:36,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:23:36,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:23:36,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:23:36,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:23:36,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:23:36" (1/1) ... [2019-12-27 21:23:36,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:36, skipping insertion in model container [2019-12-27 21:23:36,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:23:36" (1/1) ... [2019-12-27 21:23:36,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:23:36,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:23:37,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:23:37,092 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:23:37,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:23:37,264 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:23:37,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37 WrapperNode [2019-12-27 21:23:37,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:23:37,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:23:37,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:23:37,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:23:37,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:23:37,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:23:37,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:23:37,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:23:37,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (1/1) ... [2019-12-27 21:23:37,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:23:37,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:23:37,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:23:37,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:23:37,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (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 21:23:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:23:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:23:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:23:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:23:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:23:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:23:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:23:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:23:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:23:37,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:23:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:23:37,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:23:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:23:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:23:37,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:23:37,466 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 21:23:38,275 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:23:38,275 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:23:38,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:23:38 BoogieIcfgContainer [2019-12-27 21:23:38,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:23:38,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:23:38,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:23:38,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:23:38,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:23:36" (1/3) ... [2019-12-27 21:23:38,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e4d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:23:38, skipping insertion in model container [2019-12-27 21:23:38,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:23:37" (2/3) ... [2019-12-27 21:23:38,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e4d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:23:38, skipping insertion in model container [2019-12-27 21:23:38,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:23:38" (3/3) ... [2019-12-27 21:23:38,286 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2019-12-27 21:23:38,295 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:23:38,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:23:38,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:23:38,304 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:23:38,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,343 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,343 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,353 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,353 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,370 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,371 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,371 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,372 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,373 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,374 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,395 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,396 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,397 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,397 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,398 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:23:38,412 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:23:38,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:23:38,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:23:38,433 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:23:38,434 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:23:38,434 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:23:38,434 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:23:38,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:23:38,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:23:38,452 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 21:23:38,454 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:23:38,565 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:23:38,565 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:23:38,587 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 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/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:23:38,604 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:23:38,688 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:23:38,688 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:23:38,695 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 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/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:23:38,710 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:23:38,711 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:23:42,337 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 21:23:42,484 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 21:23:42,529 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-27 21:23:42,529 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 21:23:42,532 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 21:23:45,707 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-27 21:23:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-27 21:23:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:23:45,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:45,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:45,717 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 21:23:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-27 21:23:45,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:45,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011552664] [2019-12-27 21:23:45,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:45,979 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 21:23:45,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011552664] [2019-12-27 21:23:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:23:45,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1952797377] [2019-12-27 21:23:45,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:45,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:46,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:23:46,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:46,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:23:46,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:23:46,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:23:46,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:23:46,026 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-27 21:23:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:46,824 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-27 21:23:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:23:46,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:23:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:47,103 INFO L225 Difference]: With dead ends: 36046 [2019-12-27 21:23:47,104 INFO L226 Difference]: Without dead ends: 35318 [2019-12-27 21:23:47,105 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 21:23:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-27 21:23:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-27 21:23:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-27 21:23:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-27 21:23:50,418 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-27 21:23:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:50,420 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-27 21:23:50,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:23:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-27 21:23:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:23:50,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:50,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:50,433 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 21:23:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-27 21:23:50,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:50,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836238301] [2019-12-27 21:23:50,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:50,591 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 21:23:50,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836238301] [2019-12-27 21:23:50,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:50,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:23:50,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1382501794] [2019-12-27 21:23:50,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:50,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:50,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:23:50,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:50,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:23:50,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:23:50,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:50,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:23:50,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:23:50,640 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 5 states. [2019-12-27 21:23:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:51,737 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-27 21:23:51,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:23:51,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:23:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:52,106 INFO L225 Difference]: With dead ends: 54990 [2019-12-27 21:23:52,107 INFO L226 Difference]: Without dead ends: 54962 [2019-12-27 21:23:52,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:23:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-27 21:23:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-27 21:23:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-27 21:23:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-27 21:23:56,761 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-27 21:23:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:56,762 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-27 21:23:56,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:23:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-27 21:23:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:23:56,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:56,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:56,765 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 21:23:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-27 21:23:56,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:56,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765631586] [2019-12-27 21:23:56,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:23:56,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765631586] [2019-12-27 21:23:56,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:56,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:23:56,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60068631] [2019-12-27 21:23:56,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:56,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:56,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:23:56,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:56,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:23:56,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:23:56,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:56,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:23:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:23:56,830 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-27 21:23:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:57,030 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-27 21:23:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:23:57,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:23:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:57,134 INFO L225 Difference]: With dead ends: 39218 [2019-12-27 21:23:57,134 INFO L226 Difference]: Without dead ends: 39218 [2019-12-27 21:23:57,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:23:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-27 21:23:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-27 21:23:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-27 21:23:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-27 21:23:58,607 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-27 21:23:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:58,607 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-27 21:23:58,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:23:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-27 21:23:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:23:58,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:58,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:58,610 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 21:23:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:58,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-27 21:23:58,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:58,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952242208] [2019-12-27 21:23:58,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:58,675 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 21:23:58,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952242208] [2019-12-27 21:23:58,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:58,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:23:58,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1018682612] [2019-12-27 21:23:58,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:58,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:58,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:23:58,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:58,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:23:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:23:58,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:23:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:23:58,702 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 5 states. [2019-12-27 21:23:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:58,823 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-27 21:23:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:23:58,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:23:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:58,854 INFO L225 Difference]: With dead ends: 16304 [2019-12-27 21:23:58,854 INFO L226 Difference]: Without dead ends: 16304 [2019-12-27 21:23:58,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-27 21:24:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-27 21:24:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-27 21:24:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-27 21:24:00,501 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-27 21:24:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:00,501 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-27 21:24:00,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:24:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-27 21:24:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:24:00,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:00,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:00,510 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 21:24:00,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-27 21:24:00,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:00,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231484270] [2019-12-27 21:24:00,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:00,603 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 21:24:00,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231484270] [2019-12-27 21:24:00,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:00,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:24:00,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107401052] [2019-12-27 21:24:00,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:00,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:00,609 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:24:00,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:00,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:24:00,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:24:00,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:24:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:00,628 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 6 states. [2019-12-27 21:24:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:00,680 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-27 21:24:00,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:24:00,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:24:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:00,684 INFO L225 Difference]: With dead ends: 2786 [2019-12-27 21:24:00,684 INFO L226 Difference]: Without dead ends: 2786 [2019-12-27 21:24:00,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-27 21:24:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-27 21:24:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-27 21:24:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-27 21:24:00,716 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-27 21:24:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:00,716 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-27 21:24:00,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:24:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-27 21:24:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:24:00,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:00,721 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] [2019-12-27 21:24:00,721 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 21:24:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-27 21:24:00,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:00,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847809229] [2019-12-27 21:24:00,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:00,801 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 21:24:00,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847809229] [2019-12-27 21:24:00,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:00,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:00,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267295212] [2019-12-27 21:24:00,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:00,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:00,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:24:00,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:00,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:24:00,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:24:00,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:24:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:24:00,889 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 8 states. [2019-12-27 21:24:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:00,949 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-27 21:24:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:24:00,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:24:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:00,952 INFO L225 Difference]: With dead ends: 1356 [2019-12-27 21:24:00,953 INFO L226 Difference]: Without dead ends: 1356 [2019-12-27 21:24:00,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:24:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-27 21:24:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-27 21:24:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-27 21:24:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-27 21:24:00,974 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-27 21:24:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:00,974 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-27 21:24:00,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:24:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-27 21:24:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:00,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:00,979 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 21:24:00,979 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 21:24:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:00,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-27 21:24:00,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:00,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508952564] [2019-12-27 21:24:00,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:01,075 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 21:24:01,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508952564] [2019-12-27 21:24:01,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:01,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:24:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378240503] [2019-12-27 21:24:01,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:01,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:01,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:24:01,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:01,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:24:01,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:24:01,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:24:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:01,174 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-27 21:24:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:01,229 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-27 21:24:01,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:24:01,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:24:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:01,232 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 21:24:01,233 INFO L226 Difference]: Without dead ends: 1224 [2019-12-27 21:24:01,233 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 21:24:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-27 21:24:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-27 21:24:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-27 21:24:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-27 21:24:01,252 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-27 21:24:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:01,253 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-27 21:24:01,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:24:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-27 21:24:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:01,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:01,257 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 21:24:01,257 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 21:24:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-27 21:24:01,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:01,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187434454] [2019-12-27 21:24:01,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:01,408 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 21:24:01,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187434454] [2019-12-27 21:24:01,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:01,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:01,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317755952] [2019-12-27 21:24:01,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:01,427 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:01,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:24:01,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:01,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:24:01,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:24:01,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:01,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:24:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:01,622 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-27 21:24:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:01,897 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-27 21:24:01,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:24:01,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:24:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:01,901 INFO L225 Difference]: With dead ends: 1760 [2019-12-27 21:24:01,902 INFO L226 Difference]: Without dead ends: 1760 [2019-12-27 21:24:01,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-27 21:24:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-27 21:24:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-27 21:24:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-27 21:24:01,920 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-27 21:24:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:01,920 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-27 21:24:01,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:24:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-27 21:24:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:01,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:01,923 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 21:24:01,923 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 21:24:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-27 21:24:01,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:01,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829864282] [2019-12-27 21:24:01,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:02,064 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 21:24:02,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829864282] [2019-12-27 21:24:02,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:02,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:24:02,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [194934088] [2019-12-27 21:24:02,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:02,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:02,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 231 transitions. [2019-12-27 21:24:02,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:02,298 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:24:02,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:24:02,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:24:02,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:24:02,300 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 10 states. [2019-12-27 21:24:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:03,743 INFO L93 Difference]: Finished difference Result 3057 states and 8420 transitions. [2019-12-27 21:24:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:24:03,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:24:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:03,749 INFO L225 Difference]: With dead ends: 3057 [2019-12-27 21:24:03,749 INFO L226 Difference]: Without dead ends: 3057 [2019-12-27 21:24:03,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:24:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2019-12-27 21:24:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 1499. [2019-12-27 21:24:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-27 21:24:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-27 21:24:03,777 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-27 21:24:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:03,777 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-27 21:24:03,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:24:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-27 21:24:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:03,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:03,781 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 21:24:03,781 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 21:24:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-27 21:24:03,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:03,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576534956] [2019-12-27 21:24:03,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:03,885 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 21:24:03,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576534956] [2019-12-27 21:24:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:03,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:24:03,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1953558533] [2019-12-27 21:24:03,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:03,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:04,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 204 transitions. [2019-12-27 21:24:04,094 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:04,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:24:04,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:24:04,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:24:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:04,106 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 6 states. [2019-12-27 21:24:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:04,440 INFO L93 Difference]: Finished difference Result 2373 states and 6750 transitions. [2019-12-27 21:24:04,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:24:04,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 21:24:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:04,445 INFO L225 Difference]: With dead ends: 2373 [2019-12-27 21:24:04,445 INFO L226 Difference]: Without dead ends: 2373 [2019-12-27 21:24:04,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:24:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-12-27 21:24:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 1687. [2019-12-27 21:24:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-12-27 21:24:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4858 transitions. [2019-12-27 21:24:04,469 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4858 transitions. Word has length 58 [2019-12-27 21:24:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:04,469 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 4858 transitions. [2019-12-27 21:24:04,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:24:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4858 transitions. [2019-12-27 21:24:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:04,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:04,473 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 21:24:04,473 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 21:24:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1959735343, now seen corresponding path program 4 times [2019-12-27 21:24:04,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:04,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976901793] [2019-12-27 21:24:04,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:04,610 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 21:24:04,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976901793] [2019-12-27 21:24:04,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:04,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:24:04,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469255933] [2019-12-27 21:24:04,611 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:04,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:04,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 239 transitions. [2019-12-27 21:24:04,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:04,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:24:04,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:24:04,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:24:04,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:24:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:24:04,893 INFO L87 Difference]: Start difference. First operand 1687 states and 4858 transitions. Second operand 13 states. [2019-12-27 21:24:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:06,238 INFO L93 Difference]: Finished difference Result 2247 states and 6032 transitions. [2019-12-27 21:24:06,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:24:06,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-12-27 21:24:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:06,243 INFO L225 Difference]: With dead ends: 2247 [2019-12-27 21:24:06,244 INFO L226 Difference]: Without dead ends: 2247 [2019-12-27 21:24:06,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:24:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-12-27 21:24:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1371. [2019-12-27 21:24:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-12-27 21:24:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 3854 transitions. [2019-12-27 21:24:06,286 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 3854 transitions. Word has length 58 [2019-12-27 21:24:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:06,286 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 3854 transitions. [2019-12-27 21:24:06,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:24:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 3854 transitions. [2019-12-27 21:24:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:06,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:06,290 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 21:24:06,290 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 21:24:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:06,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1379010492, now seen corresponding path program 1 times [2019-12-27 21:24:06,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:06,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964404823] [2019-12-27 21:24:06,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:06,399 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 21:24:06,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964404823] [2019-12-27 21:24:06,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:06,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:24:06,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [785212980] [2019-12-27 21:24:06,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:06,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:06,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 179 transitions. [2019-12-27 21:24:06,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:06,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:24:06,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:24:06,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:24:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:06,576 INFO L87 Difference]: Start difference. First operand 1371 states and 3854 transitions. Second operand 3 states. [2019-12-27 21:24:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:06,626 INFO L93 Difference]: Finished difference Result 1371 states and 3853 transitions. [2019-12-27 21:24:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:24:06,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:24:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:06,629 INFO L225 Difference]: With dead ends: 1371 [2019-12-27 21:24:06,629 INFO L226 Difference]: Without dead ends: 1371 [2019-12-27 21:24:06,630 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 21:24:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-12-27 21:24:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1014. [2019-12-27 21:24:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 21:24:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2859 transitions. [2019-12-27 21:24:06,650 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2859 transitions. Word has length 59 [2019-12-27 21:24:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:06,651 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2859 transitions. [2019-12-27 21:24:06,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:24:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2859 transitions. [2019-12-27 21:24:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:06,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:06,654 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 21:24:06,654 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 21:24:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2055576731, now seen corresponding path program 1 times [2019-12-27 21:24:06,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:06,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873490010] [2019-12-27 21:24:06,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:06,847 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 21:24:06,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873490010] [2019-12-27 21:24:06,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:06,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:06,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925346915] [2019-12-27 21:24:06,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:06,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:06,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 207 transitions. [2019-12-27 21:24:06,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:07,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:24:07,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:24:07,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:24:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:24:07,007 INFO L87 Difference]: Start difference. First operand 1014 states and 2859 transitions. Second operand 7 states. [2019-12-27 21:24:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:07,086 INFO L93 Difference]: Finished difference Result 1397 states and 3729 transitions. [2019-12-27 21:24:07,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:24:07,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:24:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:07,088 INFO L225 Difference]: With dead ends: 1397 [2019-12-27 21:24:07,088 INFO L226 Difference]: Without dead ends: 870 [2019-12-27 21:24:07,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:24:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-12-27 21:24:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-12-27 21:24:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-12-27 21:24:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2372 transitions. [2019-12-27 21:24:07,104 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2372 transitions. Word has length 59 [2019-12-27 21:24:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:07,104 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 2372 transitions. [2019-12-27 21:24:07,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:24:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2372 transitions. [2019-12-27 21:24:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:07,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:07,107 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 21:24:07,107 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 21:24:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1719937123, now seen corresponding path program 2 times [2019-12-27 21:24:07,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:07,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912661550] [2019-12-27 21:24:07,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:07,283 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 21:24:07,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912661550] [2019-12-27 21:24:07,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:07,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:07,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172865417] [2019-12-27 21:24:07,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:07,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:07,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 248 transitions. [2019-12-27 21:24:07,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:07,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:24:07,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:24:07,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:24:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:24:07,432 INFO L87 Difference]: Start difference. First operand 870 states and 2372 transitions. Second operand 7 states. [2019-12-27 21:24:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:07,740 INFO L93 Difference]: Finished difference Result 1738 states and 4349 transitions. [2019-12-27 21:24:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:24:07,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:24:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:07,743 INFO L225 Difference]: With dead ends: 1738 [2019-12-27 21:24:07,743 INFO L226 Difference]: Without dead ends: 965 [2019-12-27 21:24:07,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:24:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-27 21:24:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 629. [2019-12-27 21:24:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-12-27 21:24:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1503 transitions. [2019-12-27 21:24:07,754 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1503 transitions. Word has length 59 [2019-12-27 21:24:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:07,754 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 1503 transitions. [2019-12-27 21:24:07,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:24:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1503 transitions. [2019-12-27 21:24:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:07,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:07,755 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 21:24:07,755 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 21:24:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash -5405835, now seen corresponding path program 3 times [2019-12-27 21:24:07,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:07,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724396473] [2019-12-27 21:24:07,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:07,817 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 21:24:07,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724396473] [2019-12-27 21:24:07,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:07,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:24:07,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823014911] [2019-12-27 21:24:07,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:07,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:07,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 246 transitions. [2019-12-27 21:24:07,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:08,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:24:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:24:08,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:08,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:24:08,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:08,023 INFO L87 Difference]: Start difference. First operand 629 states and 1503 transitions. Second operand 5 states. [2019-12-27 21:24:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:08,205 INFO L93 Difference]: Finished difference Result 704 states and 1651 transitions. [2019-12-27 21:24:08,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:24:08,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 21:24:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:08,206 INFO L225 Difference]: With dead ends: 704 [2019-12-27 21:24:08,207 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 21:24:08,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:24:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 21:24:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 594. [2019-12-27 21:24:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-12-27 21:24:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1401 transitions. [2019-12-27 21:24:08,217 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 1401 transitions. Word has length 59 [2019-12-27 21:24:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:08,217 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 1401 transitions. [2019-12-27 21:24:08,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:24:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1401 transitions. [2019-12-27 21:24:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:08,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:08,219 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 21:24:08,219 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 21:24:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:08,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1587836330, now seen corresponding path program 1 times [2019-12-27 21:24:08,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:08,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107047814] [2019-12-27 21:24:08,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:08,317 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 21:24:08,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107047814] [2019-12-27 21:24:08,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:08,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:24:08,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010909265] [2019-12-27 21:24:08,318 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:08,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:08,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 213 transitions. [2019-12-27 21:24:08,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:08,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:24:08,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:24:08,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:08,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:24:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:08,463 INFO L87 Difference]: Start difference. First operand 594 states and 1401 transitions. Second operand 6 states. [2019-12-27 21:24:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:08,597 INFO L93 Difference]: Finished difference Result 926 states and 2061 transitions. [2019-12-27 21:24:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:24:08,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:24:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:08,598 INFO L225 Difference]: With dead ends: 926 [2019-12-27 21:24:08,599 INFO L226 Difference]: Without dead ends: 273 [2019-12-27 21:24:08,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:24:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-27 21:24:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 218. [2019-12-27 21:24:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-27 21:24:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 373 transitions. [2019-12-27 21:24:08,603 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 373 transitions. Word has length 60 [2019-12-27 21:24:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:08,603 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 373 transitions. [2019-12-27 21:24:08,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:24:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 373 transitions. [2019-12-27 21:24:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:08,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:08,604 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 21:24:08,604 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 21:24:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:08,604 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 2 times [2019-12-27 21:24:08,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:08,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767093633] [2019-12-27 21:24:08,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:08,865 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 21:24:08,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767093633] [2019-12-27 21:24:08,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:08,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:24:08,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453807636] [2019-12-27 21:24:08,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:08,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:09,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 258 transitions. [2019-12-27 21:24:09,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:09,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:24:09,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:24:09,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:24:09,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:24:09,125 INFO L87 Difference]: Start difference. First operand 218 states and 373 transitions. Second operand 14 states. [2019-12-27 21:24:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:10,091 INFO L93 Difference]: Finished difference Result 456 states and 759 transitions. [2019-12-27 21:24:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:24:10,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 21:24:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:10,092 INFO L225 Difference]: With dead ends: 456 [2019-12-27 21:24:10,092 INFO L226 Difference]: Without dead ends: 426 [2019-12-27 21:24:10,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:24:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-27 21:24:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 314. [2019-12-27 21:24:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-27 21:24:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 537 transitions. [2019-12-27 21:24:10,097 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 537 transitions. Word has length 60 [2019-12-27 21:24:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:10,097 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 537 transitions. [2019-12-27 21:24:10,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:24:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 537 transitions. [2019-12-27 21:24:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:10,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:10,098 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 21:24:10,098 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 21:24:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2137491580, now seen corresponding path program 3 times [2019-12-27 21:24:10,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:10,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326577518] [2019-12-27 21:24:10,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:10,389 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 21:24:10,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326577518] [2019-12-27 21:24:10,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:10,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:24:10,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957628539] [2019-12-27 21:24:10,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:10,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:10,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 321 transitions. [2019-12-27 21:24:10,594 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:10,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:24:10,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 21:24:10,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 21:24:10,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:24:10,748 INFO L87 Difference]: Start difference. First operand 314 states and 537 transitions. Second operand 17 states. [2019-12-27 21:24:11,346 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-27 21:24:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:12,717 INFO L93 Difference]: Finished difference Result 614 states and 1001 transitions. [2019-12-27 21:24:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 21:24:12,718 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-12-27 21:24:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:12,719 INFO L225 Difference]: With dead ends: 614 [2019-12-27 21:24:12,719 INFO L226 Difference]: Without dead ends: 584 [2019-12-27 21:24:12,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 21:24:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-27 21:24:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 318. [2019-12-27 21:24:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-27 21:24:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 544 transitions. [2019-12-27 21:24:12,726 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 544 transitions. Word has length 60 [2019-12-27 21:24:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:12,726 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 544 transitions. [2019-12-27 21:24:12,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 21:24:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 544 transitions. [2019-12-27 21:24:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:12,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:12,727 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 21:24:12,727 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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 21:24:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1148639144, now seen corresponding path program 4 times [2019-12-27 21:24:12,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:12,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077619874] [2019-12-27 21:24:12,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:13,314 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 21:24:13,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077619874] [2019-12-27 21:24:13,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:13,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 21:24:13,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1967022553] [2019-12-27 21:24:13,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:13,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:13,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 210 transitions. [2019-12-27 21:24:13,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:13,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:24:13,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:24:13,610 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-12-27 21:24:13,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:24:13,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 21:24:13,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 21:24:13,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:24:13,664 INFO L87 Difference]: Start difference. First operand 318 states and 544 transitions. Second operand 21 states. [2019-12-27 21:24:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:15,256 INFO L93 Difference]: Finished difference Result 678 states and 1136 transitions. [2019-12-27 21:24:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 21:24:15,256 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-12-27 21:24:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:15,258 INFO L225 Difference]: With dead ends: 678 [2019-12-27 21:24:15,258 INFO L226 Difference]: Without dead ends: 648 [2019-12-27 21:24:15,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=337, Invalid=1643, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 21:24:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-12-27 21:24:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 328. [2019-12-27 21:24:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 21:24:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 562 transitions. [2019-12-27 21:24:15,264 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 562 transitions. Word has length 60 [2019-12-27 21:24:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:15,265 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 562 transitions. [2019-12-27 21:24:15,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 21:24:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 562 transitions. [2019-12-27 21:24:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:15,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:15,266 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 21:24:15,266 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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 21:24:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:15,266 INFO L82 PathProgramCache]: Analyzing trace with hash 360597096, now seen corresponding path program 5 times [2019-12-27 21:24:15,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:15,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128314023] [2019-12-27 21:24:15,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:15,668 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 21:24:15,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128314023] [2019-12-27 21:24:15,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:15,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:24:15,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093696810] [2019-12-27 21:24:15,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:15,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:15,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 243 transitions. [2019-12-27 21:24:15,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:15,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:24:16,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:24:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:24:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:24:16,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:24:16,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 21:24:16,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 21:24:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:24:16,274 INFO L87 Difference]: Start difference. First operand 328 states and 562 transitions. Second operand 21 states. [2019-12-27 21:24:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:17,525 INFO L93 Difference]: Finished difference Result 508 states and 838 transitions. [2019-12-27 21:24:17,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:24:17,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-12-27 21:24:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:17,527 INFO L225 Difference]: With dead ends: 508 [2019-12-27 21:24:17,527 INFO L226 Difference]: Without dead ends: 478 [2019-12-27 21:24:17,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 21:24:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-27 21:24:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 326. [2019-12-27 21:24:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-27 21:24:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 558 transitions. [2019-12-27 21:24:17,532 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 558 transitions. Word has length 60 [2019-12-27 21:24:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:17,533 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 558 transitions. [2019-12-27 21:24:17,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 21:24:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 558 transitions. [2019-12-27 21:24:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:17,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:17,534 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 21:24:17,534 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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 21:24:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 6 times [2019-12-27 21:24:17,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:17,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95259945] [2019-12-27 21:24:17,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:24:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:24:17,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:24:17,650 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:24:17,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21|) |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd4~0_15) (= (store .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21| 1) |v_#valid_71|) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21|)) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= v_~z~0_27 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1269~0.base_21|) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0) (= 0 v_~z$w_buff1_used~0_66) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1269~0.base_21| 4) |v_#length_29|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, 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_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_~#t1269~0.base=|v_ULTIMATE.start_main_~#t1269~0.base_21|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_18|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_~#t1269~0.offset=|v_ULTIMATE.start_main_~#t1269~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1270~0.offset, ~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, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1270~0.base, 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, ~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_~#t1269~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1272~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1272~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~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_~#t1269~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1271~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:24:17,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13| 1) |v_#valid_44|) (not (= |v_ULTIMATE.start_main_~#t1270~0.base_13| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1270~0.base_13|) (= |v_ULTIMATE.start_main_~#t1270~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13|) |v_ULTIMATE.start_main_~#t1270~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1270~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1270~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1270~0.base, #length] because there is no mapped edge [2019-12-27 21:24:17,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1271~0.offset_10| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1271~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11|) |v_ULTIMATE.start_main_~#t1271~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1271~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1271~0.offset] because there is no mapped edge [2019-12-27 21:24:17,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t1272~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1272~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1272~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13|) |v_ULTIMATE.start_main_~#t1272~0.offset_11| 3))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1272~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1272~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1272~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 21:24:17,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~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, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:24:17,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:24:17,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:24:17,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1990741197 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1990741197 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1990741197| ~z$w_buff0_used~0_In1990741197)) (and (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1990741197|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1990741197, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1990741197} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1990741197, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1990741197, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1990741197|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:24:17,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In-1198446388 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1198446388 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1198446388 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1198446388 256)))) (or (and (= ~z$w_buff1_used~0_In-1198446388 |P3Thread1of1ForFork3_#t~ite12_Out-1198446388|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1198446388|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1198446388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198446388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1198446388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1198446388} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1198446388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198446388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1198446388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1198446388, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1198446388|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:24:17,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1729831652 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1729831652 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out-1729831652| ~z$w_buff1~0_In-1729831652) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out-1729831652| ~z~0_In-1729831652) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1729831652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1729831652, ~z$w_buff1~0=~z$w_buff1~0_In-1729831652, ~z~0=~z~0_In-1729831652} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1729831652|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1729831652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1729831652, ~z$w_buff1~0=~z$w_buff1~0_In-1729831652, ~z~0=~z~0_In-1729831652} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:24:17,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:24:17,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1023791308 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1023791308 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1023791308|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1023791308 |P2Thread1of1ForFork2_#t~ite5_Out-1023791308|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1023791308, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1023791308} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1023791308|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1023791308, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1023791308} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:24:17,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1872540685 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1872540685 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1872540685 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1872540685 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1872540685| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out-1872540685| ~z$w_buff1_used~0_In-1872540685)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1872540685, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1872540685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1872540685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1872540685} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1872540685|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1872540685, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1872540685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1872540685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1872540685} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:24:17,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2132274112 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2132274112 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out2132274112| ~z$r_buff0_thd3~0_In2132274112) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2132274112| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2132274112, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2132274112} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2132274112, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2132274112, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2132274112|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:24:17,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1828710152 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1828710152 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1828710152 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1828710152 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1828710152| ~z$r_buff1_thd3~0_In-1828710152) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite8_Out-1828710152| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1828710152, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1828710152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1828710152, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1828710152} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1828710152, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1828710152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1828710152, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1828710152, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1828710152|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:24:17,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} 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 21:24:17,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1983758687 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1983758687 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1983758687 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out-1983758687 ~z$r_buff0_thd4~0_In-1983758687)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983758687, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1983758687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983758687, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1983758687, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1983758687|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:24:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1023715294 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1023715294 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1023715294 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1023715294 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out1023715294| ~z$r_buff1_thd4~0_In1023715294) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork3_#t~ite14_Out1023715294| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1023715294, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1023715294, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1023715294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1023715294} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1023715294, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1023715294, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1023715294|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1023715294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1023715294} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:24:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, 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 21:24:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:24:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-284959493 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-284959493 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite19_Out-284959493| |ULTIMATE.start_main_#t~ite20_Out-284959493|))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite19_Out-284959493| ~z$w_buff1~0_In-284959493)) (and (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-284959493| ~z~0_In-284959493) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-284959493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-284959493, ~z$w_buff1~0=~z$w_buff1~0_In-284959493, ~z~0=~z~0_In-284959493} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-284959493|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-284959493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-284959493, ~z$w_buff1~0=~z$w_buff1~0_In-284959493, ~z~0=~z~0_In-284959493, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-284959493|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:24:17,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1468037698 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1468037698 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1468037698| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1468037698| ~z$w_buff0_used~0_In1468037698)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1468037698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468037698} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1468037698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468037698, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1468037698|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:24:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In2022602907 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2022602907 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In2022602907 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2022602907 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2022602907 |ULTIMATE.start_main_#t~ite22_Out2022602907|)) (and (= |ULTIMATE.start_main_#t~ite22_Out2022602907| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2022602907, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2022602907, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2022602907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2022602907} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2022602907, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2022602907, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2022602907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2022602907, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2022602907|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:24:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1942210615 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1942210615 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1942210615|)) (and (= ~z$r_buff0_thd0~0_In-1942210615 |ULTIMATE.start_main_#t~ite23_Out-1942210615|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1942210615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1942210615} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1942210615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1942210615, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1942210615|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:24:17,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1839767159 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1839767159 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1839767159 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1839767159 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-1839767159|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1839767159 |ULTIMATE.start_main_#t~ite24_Out-1839767159|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839767159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839767159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1839767159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1839767159} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1839767159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839767159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1839767159, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1839767159|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1839767159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:24:17,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In130270641 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_In130270641| |ULTIMATE.start_main_#t~ite30_Out130270641|) (= ~z$w_buff0~0_In130270641 |ULTIMATE.start_main_#t~ite31_Out130270641|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite30_Out130270641| |ULTIMATE.start_main_#t~ite31_Out130270641|) .cse0 (= |ULTIMATE.start_main_#t~ite30_Out130270641| ~z$w_buff0~0_In130270641) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In130270641 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In130270641 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In130270641 256))) (= 0 (mod ~z$w_buff0_used~0_In130270641 256))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In130270641, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In130270641|, ~z$w_buff0~0=~z$w_buff0~0_In130270641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In130270641, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In130270641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In130270641, ~weak$$choice2~0=~weak$$choice2~0_In130270641} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In130270641, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out130270641|, ~z$w_buff0~0=~z$w_buff0~0_In130270641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In130270641, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In130270641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In130270641, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out130270641|, ~weak$$choice2~0=~weak$$choice2~0_In130270641} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-27 21:24:17,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1431562092 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out-1431562092| ~z$w_buff1~0_In-1431562092) (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In-1431562092| |ULTIMATE.start_main_#t~ite33_Out-1431562092|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite34_Out-1431562092| |ULTIMATE.start_main_#t~ite33_Out-1431562092|) (= |ULTIMATE.start_main_#t~ite33_Out-1431562092| ~z$w_buff1~0_In-1431562092) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1431562092 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1431562092 256))) (= (mod ~z$w_buff0_used~0_In-1431562092 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1431562092 256) 0) .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1431562092, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431562092, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431562092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431562092, ~z$w_buff1~0=~z$w_buff1~0_In-1431562092, ~weak$$choice2~0=~weak$$choice2~0_In-1431562092, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-1431562092|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1431562092, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431562092, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431562092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431562092, ~z$w_buff1~0=~z$w_buff1~0_In-1431562092, ~weak$$choice2~0=~weak$$choice2~0_In-1431562092, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1431562092|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1431562092|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:24:17,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} 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 21:24:17,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-432830943 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-432830943| |ULTIMATE.start_main_#t~ite46_Out-432830943|) (= |ULTIMATE.start_main_#t~ite45_Out-432830943| ~z$r_buff1_thd0~0_In-432830943) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-432830943 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-432830943 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In-432830943 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-432830943 256))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-432830943| ~z$r_buff1_thd0~0_In-432830943) (= |ULTIMATE.start_main_#t~ite45_In-432830943| |ULTIMATE.start_main_#t~ite45_Out-432830943|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-432830943, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-432830943, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-432830943, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-432830943, ~weak$$choice2~0=~weak$$choice2~0_In-432830943, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-432830943|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-432830943, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-432830943, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-432830943, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-432830943, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-432830943|, ~weak$$choice2~0=~weak$$choice2~0_In-432830943, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-432830943|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:24:17,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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 21:24:17,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:24:17,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:24:17 BasicIcfg [2019-12-27 21:24:17,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:24:17,777 INFO L168 Benchmark]: Toolchain (without parser) took 41313.93 ms. Allocated memory was 145.2 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 101.2 MB in the beginning and 457.7 MB in the end (delta: -356.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:24:17,777 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:24:17,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.01 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 154.0 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:17,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.62 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:17,783 INFO L168 Benchmark]: Boogie Preprocessor took 41.90 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 148.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 21:24:17,784 INFO L168 Benchmark]: RCFGBuilder took 898.95 ms. Allocated memory is still 202.9 MB. Free memory was 148.5 MB in the beginning and 98.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:17,787 INFO L168 Benchmark]: TraceAbstraction took 39496.39 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.2 MB in the beginning and 457.7 MB in the end (delta: -359.4 MB). Peak memory consumption was 986.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:17,790 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 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.01 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 154.0 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.62 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.90 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 148.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 898.95 ms. Allocated memory is still 202.9 MB. Free memory was 148.5 MB in the beginning and 98.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39496.39 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.2 MB in the beginning and 457.7 MB in the end (delta: -359.4 MB). Peak memory consumption was 986.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L833] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L835] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L837] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L808] 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) [L772] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 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 [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 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 [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 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 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L854] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L854] 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) [L855] 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)) [L856] 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)) [L857] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L857] 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)) [L858] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L858] 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)) [L860] 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)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2168 SDtfs, 3577 SDslu, 7534 SDs, 0 SdLazy, 5831 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 98 SyntacticMatches, 35 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 10278 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 907 ConstructedInterpolants, 0 QuantifiedInterpolants, 216214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...