/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:01:10,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:01:10,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:01:10,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:01:10,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:01:10,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:01:10,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:01:10,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:01:10,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:01:10,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:01:10,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:01:10,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:01:10,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:01:10,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:01:10,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:01:10,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:01:10,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:01:10,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:01:10,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:01:10,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:01:10,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:01:10,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:01:10,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:01:10,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:01:10,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:01:10,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:01:10,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:01:10,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:01:10,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:01:10,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:01:10,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:01:10,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:01:10,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:01:10,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:01:10,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:01:10,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:01:10,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:01:10,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:01:10,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:01:10,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:01:10,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:01:10,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:01:10,412 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:01:10,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:01:10,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:01:10,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:01:10,415 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:01:10,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:01:10,415 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:01:10,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:01:10,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:01:10,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:01:10,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:01:10,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:01:10,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:01:10,418 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:01:10,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:01:10,418 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:01:10,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:01:10,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:01:10,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:01:10,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:01:10,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:01:10,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:01:10,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:01:10,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:01:10,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:01:10,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:01:10,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:01:10,421 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:01:10,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:01:10,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:01:10,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:01:10,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:01:10,753 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:01:10,754 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:01:10,754 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i [2020-10-16 12:01:10,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/551fdfeaf/1187a49c73b34973991b37ff8fe64bfa/FLAGac6815297 [2020-10-16 12:01:11,363 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:01:11,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i [2020-10-16 12:01:11,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/551fdfeaf/1187a49c73b34973991b37ff8fe64bfa/FLAGac6815297 [2020-10-16 12:01:11,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/551fdfeaf/1187a49c73b34973991b37ff8fe64bfa [2020-10-16 12:01:11,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:01:11,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:01:11,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:01:11,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:01:11,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:01:11,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:11" (1/1) ... [2020-10-16 12:01:11,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106f3b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:11, skipping insertion in model container [2020-10-16 12:01:11,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:11" (1/1) ... [2020-10-16 12:01:11,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:01:11,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:01:12,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:01:12,275 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:01:12,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:01:12,440 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:01:12,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12 WrapperNode [2020-10-16 12:01:12,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:01:12,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:01:12,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:01:12,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:01:12,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:01:12,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:01:12,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:01:12,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:01:12,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... [2020-10-16 12:01:12,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:01:12,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:01:12,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:01:12,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:01:12,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-10-16 12:01:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:01:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:01:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:01:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:01:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:01:12,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:01:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:01:12,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:01:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:01:12,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:01:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:01:12,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:01:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:01:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:01:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:01:12,626 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:01:14,857 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:01:14,857 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:01:14,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:14 BoogieIcfgContainer [2020-10-16 12:01:14,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:01:14,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:01:14,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:01:14,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:01:14,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:01:11" (1/3) ... [2020-10-16 12:01:14,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6ba9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:14, skipping insertion in model container [2020-10-16 12:01:14,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:12" (2/3) ... [2020-10-16 12:01:14,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6ba9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:14, skipping insertion in model container [2020-10-16 12:01:14,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:14" (3/3) ... [2020-10-16 12:01:14,869 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_rmo.opt.i [2020-10-16 12:01:14,881 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:01:14,881 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:01:14,889 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:01:14,890 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:01:14,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,925 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,929 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,929 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,929 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,930 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,937 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,944 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,944 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,946 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,946 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,950 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,951 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,951 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:14,953 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:01:14,968 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:01:14,990 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:01:14,990 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:01:14,990 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:01:14,990 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:01:14,990 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:01:14,990 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:01:14,991 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:01:14,991 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:01:15,006 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:01:15,007 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 12:01:15,010 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 12:01:15,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 12:01:15,069 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 12:01:15,069 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:01:15,078 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 12:01:15,083 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-16 12:01:15,674 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:01:15,794 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:01:16,982 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 12:01:17,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:01:17,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:01:17,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:01:17,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:01:18,319 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-16 12:01:18,543 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 12:01:20,432 WARN L193 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-16 12:01:20,722 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-16 12:01:21,038 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:01:21,143 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:01:22,309 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-16 12:01:22,838 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:01:23,132 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 12:01:23,286 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 12:01:23,297 INFO L132 LiptonReduction]: Checked pairs total: 7917 [2020-10-16 12:01:23,297 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-16 12:01:23,305 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-16 12:01:23,568 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-16 12:01:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-16 12:01:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:01:23,580 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:23,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:23,582 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:23,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash -836286608, now seen corresponding path program 1 times [2020-10-16 12:01:23,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:23,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099066933] [2020-10-16 12:01:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:23,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099066933] [2020-10-16 12:01:23,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:23,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:23,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640509942] [2020-10-16 12:01:23,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:23,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:23,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:23,938 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-16 12:01:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:24,087 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-16 12:01:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:24,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:01:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:24,205 INFO L225 Difference]: With dead ends: 3250 [2020-10-16 12:01:24,205 INFO L226 Difference]: Without dead ends: 2650 [2020-10-16 12:01:24,208 INFO L677 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 [2020-10-16 12:01:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-16 12:01:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-16 12:01:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-16 12:01:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-16 12:01:24,455 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-16 12:01:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:24,456 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-16 12:01:24,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-16 12:01:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:01:24,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:24,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:24,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:01:24,462 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1410706723, now seen corresponding path program 1 times [2020-10-16 12:01:24,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:24,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199956591] [2020-10-16 12:01:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:24,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199956591] [2020-10-16 12:01:24,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:24,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:24,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098913246] [2020-10-16 12:01:24,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:24,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:24,601 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-16 12:01:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:24,652 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-10-16 12:01:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:24,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:01:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:24,679 INFO L225 Difference]: With dead ends: 2610 [2020-10-16 12:01:24,679 INFO L226 Difference]: Without dead ends: 2610 [2020-10-16 12:01:24,680 INFO L677 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 [2020-10-16 12:01:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-16 12:01:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-16 12:01:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-16 12:01:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-10-16 12:01:24,789 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2020-10-16 12:01:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:24,790 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-10-16 12:01:24,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-10-16 12:01:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:01:24,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:24,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:24,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:01:24,794 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash 781619348, now seen corresponding path program 1 times [2020-10-16 12:01:24,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:24,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573050672] [2020-10-16 12:01:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:24,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573050672] [2020-10-16 12:01:24,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:24,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:01:24,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695771144] [2020-10-16 12:01:24,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:24,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:24,903 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 4 states. [2020-10-16 12:01:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:24,973 INFO L93 Difference]: Finished difference Result 2590 states and 9955 transitions. [2020-10-16 12:01:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:24,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:01:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:24,997 INFO L225 Difference]: With dead ends: 2590 [2020-10-16 12:01:24,997 INFO L226 Difference]: Without dead ends: 2590 [2020-10-16 12:01:24,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2020-10-16 12:01:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2020-10-16 12:01:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2020-10-16 12:01:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 9955 transitions. [2020-10-16 12:01:25,104 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 9955 transitions. Word has length 12 [2020-10-16 12:01:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:25,105 INFO L481 AbstractCegarLoop]: Abstraction has 2590 states and 9955 transitions. [2020-10-16 12:01:25,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 9955 transitions. [2020-10-16 12:01:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:01:25,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:25,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:25,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:01:25,108 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:25,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash -287925617, now seen corresponding path program 1 times [2020-10-16 12:01:25,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:25,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198161386] [2020-10-16 12:01:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:25,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198161386] [2020-10-16 12:01:25,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:25,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:01:25,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758866000] [2020-10-16 12:01:25,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:25,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:25,185 INFO L87 Difference]: Start difference. First operand 2590 states and 9955 transitions. Second operand 4 states. [2020-10-16 12:01:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:25,267 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-16 12:01:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:25,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:01:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:25,290 INFO L225 Difference]: With dead ends: 2450 [2020-10-16 12:01:25,290 INFO L226 Difference]: Without dead ends: 2450 [2020-10-16 12:01:25,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-16 12:01:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-16 12:01:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-16 12:01:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-16 12:01:25,385 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 13 [2020-10-16 12:01:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:25,386 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-16 12:01:25,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-16 12:01:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:01:25,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:25,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:25,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:01:25,388 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:25,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1541590479, now seen corresponding path program 1 times [2020-10-16 12:01:25,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:25,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758657734] [2020-10-16 12:01:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:25,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758657734] [2020-10-16 12:01:25,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:25,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:25,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805077184] [2020-10-16 12:01:25,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:25,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:25,462 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-10-16 12:01:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:25,566 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-10-16 12:01:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:25,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:01:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:25,608 INFO L225 Difference]: With dead ends: 2418 [2020-10-16 12:01:25,609 INFO L226 Difference]: Without dead ends: 2418 [2020-10-16 12:01:25,609 INFO L677 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 [2020-10-16 12:01:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-10-16 12:01:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-10-16 12:01:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-10-16 12:01:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-10-16 12:01:25,692 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 13 [2020-10-16 12:01:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:25,692 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-10-16 12:01:25,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-10-16 12:01:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:01:25,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:25,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:25,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:01:25,696 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:25,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash -337746026, now seen corresponding path program 1 times [2020-10-16 12:01:25,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:25,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489632873] [2020-10-16 12:01:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:25,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489632873] [2020-10-16 12:01:25,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:25,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:25,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788271637] [2020-10-16 12:01:25,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:25,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:25,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:25,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:25,804 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 5 states. [2020-10-16 12:01:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:25,911 INFO L93 Difference]: Finished difference Result 2482 states and 9438 transitions. [2020-10-16 12:01:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:25,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:01:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:25,924 INFO L225 Difference]: With dead ends: 2482 [2020-10-16 12:01:25,924 INFO L226 Difference]: Without dead ends: 2482 [2020-10-16 12:01:25,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2020-10-16 12:01:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2482. [2020-10-16 12:01:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-10-16 12:01:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9438 transitions. [2020-10-16 12:01:26,010 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9438 transitions. Word has length 14 [2020-10-16 12:01:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:26,010 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 9438 transitions. [2020-10-16 12:01:26,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9438 transitions. [2020-10-16 12:01:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:01:26,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:26,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:26,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:01:26,014 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -31126931, now seen corresponding path program 1 times [2020-10-16 12:01:26,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:26,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867653981] [2020-10-16 12:01:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:26,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867653981] [2020-10-16 12:01:26,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:26,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:26,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566640315] [2020-10-16 12:01:26,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:26,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:26,137 INFO L87 Difference]: Start difference. First operand 2482 states and 9438 transitions. Second operand 5 states. [2020-10-16 12:01:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:26,266 INFO L93 Difference]: Finished difference Result 2474 states and 9392 transitions. [2020-10-16 12:01:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:26,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:01:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:26,277 INFO L225 Difference]: With dead ends: 2474 [2020-10-16 12:01:26,278 INFO L226 Difference]: Without dead ends: 2474 [2020-10-16 12:01:26,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2020-10-16 12:01:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2434. [2020-10-16 12:01:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-10-16 12:01:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9238 transitions. [2020-10-16 12:01:26,351 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9238 transitions. Word has length 15 [2020-10-16 12:01:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:26,351 INFO L481 AbstractCegarLoop]: Abstraction has 2434 states and 9238 transitions. [2020-10-16 12:01:26,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9238 transitions. [2020-10-16 12:01:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:26,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:26,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:26,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:01:26,356 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:26,356 INFO L82 PathProgramCache]: Analyzing trace with hash -758016294, now seen corresponding path program 1 times [2020-10-16 12:01:26,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:26,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26688627] [2020-10-16 12:01:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:26,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26688627] [2020-10-16 12:01:26,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:26,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:26,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794436203] [2020-10-16 12:01:26,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:26,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:26,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:26,438 INFO L87 Difference]: Start difference. First operand 2434 states and 9238 transitions. Second operand 5 states. [2020-10-16 12:01:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:26,553 INFO L93 Difference]: Finished difference Result 2634 states and 10064 transitions. [2020-10-16 12:01:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:26,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:01:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:26,564 INFO L225 Difference]: With dead ends: 2634 [2020-10-16 12:01:26,564 INFO L226 Difference]: Without dead ends: 2634 [2020-10-16 12:01:26,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2020-10-16 12:01:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2020-10-16 12:01:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2634 states. [2020-10-16 12:01:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 10064 transitions. [2020-10-16 12:01:26,718 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 10064 transitions. Word has length 16 [2020-10-16 12:01:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:26,718 INFO L481 AbstractCegarLoop]: Abstraction has 2634 states and 10064 transitions. [2020-10-16 12:01:26,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 10064 transitions. [2020-10-16 12:01:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:26,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:26,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:26,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:01:26,723 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:26,724 INFO L82 PathProgramCache]: Analyzing trace with hash -964935120, now seen corresponding path program 2 times [2020-10-16 12:01:26,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:26,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615705133] [2020-10-16 12:01:26,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:26,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615705133] [2020-10-16 12:01:26,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:26,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:26,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813755771] [2020-10-16 12:01:26,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:26,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:26,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:26,824 INFO L87 Difference]: Start difference. First operand 2634 states and 10064 transitions. Second operand 6 states. [2020-10-16 12:01:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:27,075 INFO L93 Difference]: Finished difference Result 3042 states and 11574 transitions. [2020-10-16 12:01:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:01:27,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:01:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,089 INFO L225 Difference]: With dead ends: 3042 [2020-10-16 12:01:27,089 INFO L226 Difference]: Without dead ends: 3042 [2020-10-16 12:01:27,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:01:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-10-16 12:01:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2786. [2020-10-16 12:01:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2020-10-16 12:01:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 10534 transitions. [2020-10-16 12:01:27,177 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 10534 transitions. Word has length 16 [2020-10-16 12:01:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:27,178 INFO L481 AbstractCegarLoop]: Abstraction has 2786 states and 10534 transitions. [2020-10-16 12:01:27,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 10534 transitions. [2020-10-16 12:01:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:27,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:27,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:27,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:01:27,183 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1782844021, now seen corresponding path program 1 times [2020-10-16 12:01:27,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:27,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997834547] [2020-10-16 12:01:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:27,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997834547] [2020-10-16 12:01:27,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:27,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:27,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230069644] [2020-10-16 12:01:27,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:27,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:27,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:27,298 INFO L87 Difference]: Start difference. First operand 2786 states and 10534 transitions. Second operand 6 states. [2020-10-16 12:01:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:27,451 INFO L93 Difference]: Finished difference Result 3082 states and 11696 transitions. [2020-10-16 12:01:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:01:27,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:01:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,466 INFO L225 Difference]: With dead ends: 3082 [2020-10-16 12:01:27,466 INFO L226 Difference]: Without dead ends: 3082 [2020-10-16 12:01:27,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2020-10-16 12:01:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2786. [2020-10-16 12:01:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2020-10-16 12:01:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 10502 transitions. [2020-10-16 12:01:27,555 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 10502 transitions. Word has length 16 [2020-10-16 12:01:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:27,556 INFO L481 AbstractCegarLoop]: Abstraction has 2786 states and 10502 transitions. [2020-10-16 12:01:27,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 10502 transitions. [2020-10-16 12:01:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:27,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:27,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:27,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:01:27,562 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1843516725, now seen corresponding path program 1 times [2020-10-16 12:01:27,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:27,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443236110] [2020-10-16 12:01:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:27,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443236110] [2020-10-16 12:01:27,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:27,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:27,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469159974] [2020-10-16 12:01:27,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:27,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:27,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:27,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:27,638 INFO L87 Difference]: Start difference. First operand 2786 states and 10502 transitions. Second operand 5 states. [2020-10-16 12:01:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:27,735 INFO L93 Difference]: Finished difference Result 3990 states and 14801 transitions. [2020-10-16 12:01:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:27,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:01:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,747 INFO L225 Difference]: With dead ends: 3990 [2020-10-16 12:01:27,748 INFO L226 Difference]: Without dead ends: 2810 [2020-10-16 12:01:27,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2020-10-16 12:01:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2642. [2020-10-16 12:01:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2642 states. [2020-10-16 12:01:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 9526 transitions. [2020-10-16 12:01:27,834 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 9526 transitions. Word has length 16 [2020-10-16 12:01:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:27,834 INFO L481 AbstractCegarLoop]: Abstraction has 2642 states and 9526 transitions. [2020-10-16 12:01:27,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 9526 transitions. [2020-10-16 12:01:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:27,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:27,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:27,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:01:27,840 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash 569457625, now seen corresponding path program 2 times [2020-10-16 12:01:27,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:27,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138719778] [2020-10-16 12:01:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:27,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138719778] [2020-10-16 12:01:27,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:27,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:27,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021743681] [2020-10-16 12:01:27,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:27,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:27,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:27,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:27,954 INFO L87 Difference]: Start difference. First operand 2642 states and 9526 transitions. Second operand 4 states. [2020-10-16 12:01:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:28,006 INFO L93 Difference]: Finished difference Result 2616 states and 8579 transitions. [2020-10-16 12:01:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:28,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:01:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:28,015 INFO L225 Difference]: With dead ends: 2616 [2020-10-16 12:01:28,015 INFO L226 Difference]: Without dead ends: 1952 [2020-10-16 12:01:28,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2020-10-16 12:01:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2020-10-16 12:01:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2020-10-16 12:01:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 6334 transitions. [2020-10-16 12:01:28,187 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 6334 transitions. Word has length 16 [2020-10-16 12:01:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:28,187 INFO L481 AbstractCegarLoop]: Abstraction has 1952 states and 6334 transitions. [2020-10-16 12:01:28,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:28,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 6334 transitions. [2020-10-16 12:01:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:01:28,191 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:28,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:28,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:01:28,191 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:28,192 INFO L82 PathProgramCache]: Analyzing trace with hash -663489697, now seen corresponding path program 1 times [2020-10-16 12:01:28,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:28,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56442896] [2020-10-16 12:01:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:28,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56442896] [2020-10-16 12:01:28,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:28,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:28,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114603832] [2020-10-16 12:01:28,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:28,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:28,322 INFO L87 Difference]: Start difference. First operand 1952 states and 6334 transitions. Second operand 5 states. [2020-10-16 12:01:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:28,383 INFO L93 Difference]: Finished difference Result 1648 states and 4957 transitions. [2020-10-16 12:01:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:01:28,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:01:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:28,388 INFO L225 Difference]: With dead ends: 1648 [2020-10-16 12:01:28,388 INFO L226 Difference]: Without dead ends: 1251 [2020-10-16 12:01:28,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2020-10-16 12:01:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2020-10-16 12:01:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2020-10-16 12:01:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 3700 transitions. [2020-10-16 12:01:28,423 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 3700 transitions. Word has length 17 [2020-10-16 12:01:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:28,423 INFO L481 AbstractCegarLoop]: Abstraction has 1251 states and 3700 transitions. [2020-10-16 12:01:28,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 3700 transitions. [2020-10-16 12:01:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:01:28,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:28,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:28,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:01:28,427 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1193922686, now seen corresponding path program 1 times [2020-10-16 12:01:28,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:28,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153411511] [2020-10-16 12:01:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:28,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153411511] [2020-10-16 12:01:28,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:28,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:28,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886177786] [2020-10-16 12:01:28,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:28,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:28,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:28,569 INFO L87 Difference]: Start difference. First operand 1251 states and 3700 transitions. Second operand 6 states. [2020-10-16 12:01:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:28,636 INFO L93 Difference]: Finished difference Result 1108 states and 3254 transitions. [2020-10-16 12:01:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:01:28,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:01:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:28,641 INFO L225 Difference]: With dead ends: 1108 [2020-10-16 12:01:28,641 INFO L226 Difference]: Without dead ends: 992 [2020-10-16 12:01:28,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2020-10-16 12:01:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 880. [2020-10-16 12:01:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-10-16 12:01:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2625 transitions. [2020-10-16 12:01:28,661 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2625 transitions. Word has length 20 [2020-10-16 12:01:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:28,661 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 2625 transitions. [2020-10-16 12:01:28,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2625 transitions. [2020-10-16 12:01:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:01:28,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:28,664 INFO L422 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] [2020-10-16 12:01:28,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:01:28,664 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1747607, now seen corresponding path program 1 times [2020-10-16 12:01:28,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:28,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707457100] [2020-10-16 12:01:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:28,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707457100] [2020-10-16 12:01:28,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:28,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:28,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486861485] [2020-10-16 12:01:28,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:28,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:28,726 INFO L87 Difference]: Start difference. First operand 880 states and 2625 transitions. Second operand 4 states. [2020-10-16 12:01:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:28,746 INFO L93 Difference]: Finished difference Result 1120 states and 3242 transitions. [2020-10-16 12:01:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:28,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-16 12:01:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:28,750 INFO L225 Difference]: With dead ends: 1120 [2020-10-16 12:01:28,750 INFO L226 Difference]: Without dead ends: 823 [2020-10-16 12:01:28,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-10-16 12:01:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 820. [2020-10-16 12:01:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-10-16 12:01:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 2350 transitions. [2020-10-16 12:01:28,770 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 2350 transitions. Word has length 23 [2020-10-16 12:01:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:28,770 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 2350 transitions. [2020-10-16 12:01:28,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 2350 transitions. [2020-10-16 12:01:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:01:28,774 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:28,774 INFO L422 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] [2020-10-16 12:01:28,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:01:28,774 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash -575734773, now seen corresponding path program 2 times [2020-10-16 12:01:28,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:28,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621360952] [2020-10-16 12:01:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:28,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621360952] [2020-10-16 12:01:28,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:28,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:01:28,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869053432] [2020-10-16 12:01:28,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:28,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:28,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:28,913 INFO L87 Difference]: Start difference. First operand 820 states and 2350 transitions. Second operand 7 states. [2020-10-16 12:01:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:28,994 INFO L93 Difference]: Finished difference Result 793 states and 2296 transitions. [2020-10-16 12:01:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:01:28,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-16 12:01:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:28,997 INFO L225 Difference]: With dead ends: 793 [2020-10-16 12:01:28,997 INFO L226 Difference]: Without dead ends: 302 [2020-10-16 12:01:28,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:01:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-16 12:01:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2020-10-16 12:01:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-16 12:01:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 803 transitions. [2020-10-16 12:01:29,004 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 803 transitions. Word has length 23 [2020-10-16 12:01:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:29,005 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 803 transitions. [2020-10-16 12:01:29,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 803 transitions. [2020-10-16 12:01:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:29,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:29,009 INFO L422 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] [2020-10-16 12:01:29,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:01:29,009 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1693882114, now seen corresponding path program 1 times [2020-10-16 12:01:29,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:29,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382396405] [2020-10-16 12:01:29,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:29,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382396405] [2020-10-16 12:01:29,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:29,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 12:01:29,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141169836] [2020-10-16 12:01:29,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:01:29,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:29,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:01:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:01:29,217 INFO L87 Difference]: Start difference. First operand 302 states and 803 transitions. Second operand 10 states. [2020-10-16 12:01:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:29,473 INFO L93 Difference]: Finished difference Result 495 states and 1257 transitions. [2020-10-16 12:01:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 12:01:29,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-10-16 12:01:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:29,475 INFO L225 Difference]: With dead ends: 495 [2020-10-16 12:01:29,475 INFO L226 Difference]: Without dead ends: 253 [2020-10-16 12:01:29,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:01:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-10-16 12:01:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 198. [2020-10-16 12:01:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-16 12:01:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 475 transitions. [2020-10-16 12:01:29,481 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 475 transitions. Word has length 27 [2020-10-16 12:01:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:29,481 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 475 transitions. [2020-10-16 12:01:29,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:01:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 475 transitions. [2020-10-16 12:01:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:29,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:29,483 INFO L422 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] [2020-10-16 12:01:29,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:01:29,483 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:29,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1166534016, now seen corresponding path program 2 times [2020-10-16 12:01:29,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:29,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716241857] [2020-10-16 12:01:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:29,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716241857] [2020-10-16 12:01:29,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:29,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:29,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345559987] [2020-10-16 12:01:29,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:29,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:29,580 INFO L87 Difference]: Start difference. First operand 198 states and 475 transitions. Second operand 6 states. [2020-10-16 12:01:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:29,669 INFO L93 Difference]: Finished difference Result 240 states and 559 transitions. [2020-10-16 12:01:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:01:29,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-16 12:01:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:29,670 INFO L225 Difference]: With dead ends: 240 [2020-10-16 12:01:29,670 INFO L226 Difference]: Without dead ends: 138 [2020-10-16 12:01:29,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:01:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-16 12:01:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-16 12:01:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-16 12:01:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions. [2020-10-16 12:01:29,674 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 27 [2020-10-16 12:01:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:29,674 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 323 transitions. [2020-10-16 12:01:29,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions. [2020-10-16 12:01:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:29,675 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:29,676 INFO L422 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] [2020-10-16 12:01:29,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:01:29,676 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash 114942006, now seen corresponding path program 3 times [2020-10-16 12:01:29,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:29,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159663066] [2020-10-16 12:01:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:01:29,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159663066] [2020-10-16 12:01:29,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:29,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:29,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330451435] [2020-10-16 12:01:29,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:29,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:29,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:29,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:29,812 INFO L87 Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 7 states. [2020-10-16 12:01:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:29,918 INFO L93 Difference]: Finished difference Result 188 states and 441 transitions. [2020-10-16 12:01:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:01:29,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-16 12:01:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:29,920 INFO L225 Difference]: With dead ends: 188 [2020-10-16 12:01:29,920 INFO L226 Difference]: Without dead ends: 138 [2020-10-16 12:01:29,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:01:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-16 12:01:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2020-10-16 12:01:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-16 12:01:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 243 transitions. [2020-10-16 12:01:29,926 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 243 transitions. Word has length 27 [2020-10-16 12:01:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:29,927 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 243 transitions. [2020-10-16 12:01:29,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 243 transitions. [2020-10-16 12:01:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:29,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:29,928 INFO L422 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] [2020-10-16 12:01:29,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:01:29,928 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1014745852, now seen corresponding path program 4 times [2020-10-16 12:01:29,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:29,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382327453] [2020-10-16 12:01:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:01:30,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:01:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:01:30,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:01:30,109 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:01:30,109 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:01:30,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:01:30,111 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:01:30,134 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In1321655440 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In1321655440 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1321655440 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1321655440 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff1_thd0~0_Out1321655440 ~y$r_buff1_thd0~0_In1321655440) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1321655440 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1321655440|) (or (and .cse0 (= ~y$w_buff1_used~0_Out1321655440 ~y$w_buff1_used~0_In1321655440)) (and .cse1 (= ~y$w_buff1_used~0_Out1321655440 0) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1321655440 0)) (or (and (or (and .cse1 (= ~y~0_Out1321655440 ~y$w_buff1~0_In1321655440) .cse2) (and .cse0 (= ~y~0_In1321655440 ~y~0_Out1321655440))) .cse3) (and .cse4 .cse5 (= ~y$w_buff0~0_In1321655440 ~y~0_Out1321655440))) (= ~y$r_buff0_thd0~0_Out1321655440 ~y$r_buff0_thd0~0_In1321655440) (or (and (= ~y$w_buff0_used~0_In1321655440 ~y$w_buff0_used~0_Out1321655440) .cse3) (and (= ~y$w_buff0_used~0_Out1321655440 0) .cse4 .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1321655440|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1321655440, ~y$w_buff1~0=~y$w_buff1~0_In1321655440, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1321655440, ~y$w_buff0~0=~y$w_buff0~0_In1321655440, ~y~0=~y~0_In1321655440, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1321655440, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1321655440} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1321655440, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1321655440|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1321655440|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1321655440|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1321655440|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1321655440|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1321655440|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1321655440|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1321655440, ~y$w_buff1~0=~y$w_buff1~0_In1321655440, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1321655440, ~y$w_buff0~0=~y$w_buff0~0_In1321655440, ~y~0=~y~0_Out1321655440, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1321655440, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1321655440} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:01:30,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,145 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,145 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,145 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,146 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,146 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,147 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,147 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,147 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,148 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,148 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,149 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,150 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,151 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,151 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,152 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,152 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,152 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,153 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,153 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,153 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,153 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,154 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:01:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:30,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:30 BasicIcfg [2020-10-16 12:01:30,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:01:30,275 INFO L168 Benchmark]: Toolchain (without parser) took 18618.32 ms. Allocated memory was 139.5 MB in the beginning and 541.6 MB in the end (delta: 402.1 MB). Free memory was 101.0 MB in the beginning and 397.6 MB in the end (delta: -296.6 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:30,276 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:01:30,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.05 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:30,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.32 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:30,278 INFO L168 Benchmark]: Boogie Preprocessor took 42.69 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:30,279 INFO L168 Benchmark]: RCFGBuilder took 2307.05 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 151.9 MB in the beginning and 172.0 MB in the end (delta: -20.1 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:30,279 INFO L168 Benchmark]: TraceAbstraction took 15412.29 ms. Allocated memory was 249.0 MB in the beginning and 541.6 MB in the end (delta: 292.6 MB). Free memory was 172.0 MB in the beginning and 397.6 MB in the end (delta: -225.6 MB). Peak memory consumption was 66.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:30,287 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.05 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.32 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.69 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2307.05 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 151.9 MB in the beginning and 172.0 MB in the end (delta: -20.1 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15412.29 ms. Allocated memory was 249.0 MB in the beginning and 541.6 MB in the end (delta: 292.6 MB). Free memory was 172.0 MB in the beginning and 397.6 MB in the end (delta: -225.6 MB). Peak memory consumption was 66.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1314 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 127 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.2s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 33 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 7917 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L714] 0 _Bool y$flush_delayed; [L715] 0 int y$mem_tmp; [L716] 0 _Bool y$r_buff0_thd0; [L717] 0 _Bool y$r_buff0_thd1; [L718] 0 _Bool y$r_buff0_thd2; [L719] 0 _Bool y$r_buff0_thd3; [L720] 0 _Bool y$r_buff0_thd4; [L721] 0 _Bool y$r_buff1_thd0; [L722] 0 _Bool y$r_buff1_thd1; [L723] 0 _Bool y$r_buff1_thd2; [L724] 0 _Bool y$r_buff1_thd3; [L725] 0 _Bool y$r_buff1_thd4; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L835] 0 pthread_t t789; [L836] FCALL, FORK 0 pthread_create(&t789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t790; [L838] FCALL, FORK 0 pthread_create(&t790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t791; [L840] FCALL, FORK 0 pthread_create(&t791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t792; [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L784] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t792, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L807] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L810] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L814] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L815] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L816] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L817] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L817] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L742] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 y$flush_delayed = weak$$choice2 [L858] 0 y$mem_tmp = y [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L860] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L860] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L861] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L862] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L862] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L864] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 651 SDtfs, 890 SDslu, 1308 SDs, 0 SdLazy, 691 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 954 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 41656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...