/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/mix030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:01:16,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:01:16,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:01:16,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:01:16,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:01:16,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:01:16,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:01:16,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:01:16,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:01:16,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:01:16,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:01:16,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:01:16,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:01:16,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:01:16,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:01:16,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:01:16,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:01:16,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:01:16,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:01:16,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:01:16,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:01:16,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:01:16,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:01:16,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:01:16,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:01:16,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:01:16,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:01:16,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:01:16,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:01:17,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:01:17,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:01:17,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:01:17,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:01:17,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:01:17,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:01:17,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:01:17,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:01:17,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:01:17,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:01:17,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:01:17,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:01:17,016 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:17,056 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:01:17,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:01:17,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:01:17,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:01:17,060 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:01:17,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:01:17,060 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:01:17,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:01:17,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:01:17,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:01:17,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:01:17,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:01:17,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:01:17,063 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:01:17,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:01:17,063 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:01:17,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:01:17,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:01:17,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:01:17,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:01:17,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:01:17,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:01:17,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:01:17,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:01:17,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:01:17,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:01:17,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:01:17,066 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:01:17,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:01:17,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:01:17,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:01:17,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:01:17,465 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:01:17,466 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:01:17,467 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-16 12:01:17,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc3b1b7d8/5906af5ff86543a99fc28884f4e10f86/FLAGad5922fff [2020-10-16 12:01:18,094 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:01:18,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-16 12:01:18,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc3b1b7d8/5906af5ff86543a99fc28884f4e10f86/FLAGad5922fff [2020-10-16 12:01:18,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc3b1b7d8/5906af5ff86543a99fc28884f4e10f86 [2020-10-16 12:01:18,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:01:18,319 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:01:18,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:01:18,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:01:18,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:01:18,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:18" (1/1) ... [2020-10-16 12:01:18,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd2c79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:18, skipping insertion in model container [2020-10-16 12:01:18,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:18" (1/1) ... [2020-10-16 12:01:18,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:01:18,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:01:19,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:01:19,023 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:01:19,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:01:19,184 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:01:19,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:19 WrapperNode [2020-10-16 12:01:19,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:01:19,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:01:19,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:01:19,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:01:19,200 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:19" (1/1) ... [2020-10-16 12:01:19,229 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:19" (1/1) ... [2020-10-16 12:01:19,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:01:19,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:01:19,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:01:19,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:01:19,279 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:19" (1/1) ... [2020-10-16 12:01:19,279 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:19" (1/1) ... [2020-10-16 12:01:19,286 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:19" (1/1) ... [2020-10-16 12:01:19,286 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:19" (1/1) ... [2020-10-16 12:01:19,297 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:19" (1/1) ... [2020-10-16 12:01:19,301 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:19" (1/1) ... [2020-10-16 12:01:19,306 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:19" (1/1) ... [2020-10-16 12:01:19,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:01:19,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:01:19,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:01:19,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:01:19,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:19" (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:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:01:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:01:19,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:01:19,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:01:19,385 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:01:19,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:01:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:01:19,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:01:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:01:19,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:01:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:01:19,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:01:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:01:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:01:19,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:01:19,389 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:21,453 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:01:21,454 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:01:21,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:21 BoogieIcfgContainer [2020-10-16 12:01:21,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:01:21,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:01:21,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:01:21,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:01:21,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:01:18" (1/3) ... [2020-10-16 12:01:21,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7160a684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:21, skipping insertion in model container [2020-10-16 12:01:21,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:19" (2/3) ... [2020-10-16 12:01:21,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7160a684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:21, skipping insertion in model container [2020-10-16 12:01:21,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:21" (3/3) ... [2020-10-16 12:01:21,466 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2020-10-16 12:01:21,478 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:01:21,478 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:01:21,487 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:01:21,488 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:01:21,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,525 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:21,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,525 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:21,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,528 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,528 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,536 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,536 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,546 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:21,546 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,546 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,547 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:21,549 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:01:21,564 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:01:21,589 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:01:21,589 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:01:21,590 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:01:21,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:01:21,590 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:01:21,590 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:01:21,590 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:01:21,591 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:01:21,606 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:01:21,607 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-16 12:01:21,610 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-16 12:01:21,612 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 12:01:21,695 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 12:01:21,697 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:01:21,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 12:01:21,719 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-16 12:01:22,991 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:23,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:01:23,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:01:23,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:01:23,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:01:23,863 WARN L193 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 12:01:24,398 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:01:25,134 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:01:25,250 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:01:26,527 WARN L193 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-16 12:01:26,845 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 12:01:27,334 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 12:01:27,476 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 12:01:28,737 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2020-10-16 12:01:29,245 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:01:29,269 INFO L132 LiptonReduction]: Checked pairs total: 7068 [2020-10-16 12:01:29,269 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 12:01:29,275 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-16 12:01:29,514 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-16 12:01:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-16 12:01:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:01:29,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:29,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:29,526 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:29,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1030616479, now seen corresponding path program 1 times [2020-10-16 12:01:29,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:29,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534118673] [2020-10-16 12:01:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:29,856 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,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534118673] [2020-10-16 12:01:29,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:29,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:29,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522748303] [2020-10-16 12:01:29,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:29,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:29,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:29,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:29,881 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-16 12:01:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:30,031 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-16 12:01:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:30,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:01:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:30,081 INFO L225 Difference]: With dead ends: 3250 [2020-10-16 12:01:30,081 INFO L226 Difference]: Without dead ends: 2650 [2020-10-16 12:01:30,082 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:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-16 12:01:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-16 12:01:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-16 12:01:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-16 12:01:30,271 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-16 12:01:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:30,272 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-16 12:01:30,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-16 12:01:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:01:30,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:30,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:30,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:01:30,276 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:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1072761819, now seen corresponding path program 1 times [2020-10-16 12:01:30,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:30,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310149772] [2020-10-16 12:01:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:30,388 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:30,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310149772] [2020-10-16 12:01:30,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:30,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:30,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729571631] [2020-10-16 12:01:30,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:30,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:30,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:30,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:30,392 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-16 12:01:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:30,433 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-10-16 12:01:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:30,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:01:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:30,456 INFO L225 Difference]: With dead ends: 2610 [2020-10-16 12:01:30,457 INFO L226 Difference]: Without dead ends: 2610 [2020-10-16 12:01:30,458 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:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-16 12:01:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-16 12:01:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-16 12:01:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-10-16 12:01:30,565 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2020-10-16 12:01:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:30,566 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-10-16 12:01:30,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-10-16 12:01:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:01:30,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:30,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:30,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:01:30,570 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:30,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1104121036, now seen corresponding path program 1 times [2020-10-16 12:01:30,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:30,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617198512] [2020-10-16 12:01:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:30,739 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:30,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617198512] [2020-10-16 12:01:30,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:30,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:30,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026463999] [2020-10-16 12:01:30,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:30,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:30,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:30,742 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 3 states. [2020-10-16 12:01:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:30,813 INFO L93 Difference]: Finished difference Result 2590 states and 9955 transitions. [2020-10-16 12:01:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:30,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:01:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:30,836 INFO L225 Difference]: With dead ends: 2590 [2020-10-16 12:01:30,837 INFO L226 Difference]: Without dead ends: 2590 [2020-10-16 12:01:30,838 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:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2020-10-16 12:01:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2020-10-16 12:01:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2020-10-16 12:01:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 9955 transitions. [2020-10-16 12:01:30,942 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 9955 transitions. Word has length 12 [2020-10-16 12:01:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:30,944 INFO L481 AbstractCegarLoop]: Abstraction has 2590 states and 9955 transitions. [2020-10-16 12:01:30,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 9955 transitions. [2020-10-16 12:01:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:01:30,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:30,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:30,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:01:30,952 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:30,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1798747636, now seen corresponding path program 1 times [2020-10-16 12:01:30,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:30,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369130189] [2020-10-16 12:01:30,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:31,008 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:31,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369130189] [2020-10-16 12:01:31,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:31,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:31,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481369141] [2020-10-16 12:01:31,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:31,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:31,011 INFO L87 Difference]: Start difference. First operand 2590 states and 9955 transitions. Second operand 3 states. [2020-10-16 12:01:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:31,042 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-16 12:01:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:31,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:01:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:31,063 INFO L225 Difference]: With dead ends: 2450 [2020-10-16 12:01:31,063 INFO L226 Difference]: Without dead ends: 2450 [2020-10-16 12:01:31,064 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:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-16 12:01:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-16 12:01:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-16 12:01:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-16 12:01:31,226 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 13 [2020-10-16 12:01:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:31,227 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-16 12:01:31,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-16 12:01:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:01:31,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:31,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:31,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:01:31,229 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:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:31,230 INFO L82 PathProgramCache]: Analyzing trace with hash -131988125, now seen corresponding path program 1 times [2020-10-16 12:01:31,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:31,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470203907] [2020-10-16 12:01:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:31,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:31,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470203907] [2020-10-16 12:01:31,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:31,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:31,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103025260] [2020-10-16 12:01:31,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:31,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:31,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:31,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:31,300 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-10-16 12:01:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:31,339 INFO L93 Difference]: Finished difference Result 2410 states and 9176 transitions. [2020-10-16 12:01:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:31,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:01:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:31,382 INFO L225 Difference]: With dead ends: 2410 [2020-10-16 12:01:31,382 INFO L226 Difference]: Without dead ends: 2410 [2020-10-16 12:01:31,382 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:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-16 12:01:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-16 12:01:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-16 12:01:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions. [2020-10-16 12:01:31,469 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 13 [2020-10-16 12:01:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:31,469 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions. [2020-10-16 12:01:31,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions. [2020-10-16 12:01:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:01:31,472 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:31,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:31,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:01:31,473 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:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1786313371, now seen corresponding path program 1 times [2020-10-16 12:01:31,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:31,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596884089] [2020-10-16 12:01:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:31,588 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:31,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596884089] [2020-10-16 12:01:31,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:31,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:31,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677993108] [2020-10-16 12:01:31,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:31,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:31,591 INFO L87 Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 3 states. [2020-10-16 12:01:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:31,653 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-10-16 12:01:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:31,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-16 12:01:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:31,664 INFO L225 Difference]: With dead ends: 2386 [2020-10-16 12:01:31,665 INFO L226 Difference]: Without dead ends: 2386 [2020-10-16 12:01:31,665 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:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-16 12:01:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-10-16 12:01:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-10-16 12:01:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-10-16 12:01:31,739 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-10-16 12:01:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:31,740 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-10-16 12:01:31,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-10-16 12:01:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:01:31,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:31,743 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:31,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:01:31,744 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:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash 222355305, now seen corresponding path program 1 times [2020-10-16 12:01:31,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:31,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847648459] [2020-10-16 12:01:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:31,843 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:31,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847648459] [2020-10-16 12:01:31,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:31,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:31,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903505296] [2020-10-16 12:01:31,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:31,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:31,845 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-10-16 12:01:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:31,947 INFO L93 Difference]: Finished difference Result 2378 states and 9024 transitions. [2020-10-16 12:01:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:31,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:01:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:31,958 INFO L225 Difference]: With dead ends: 2378 [2020-10-16 12:01:31,958 INFO L226 Difference]: Without dead ends: 2378 [2020-10-16 12:01:31,959 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:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-10-16 12:01:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2338. [2020-10-16 12:01:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-10-16 12:01:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions. [2020-10-16 12:01:32,037 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15 [2020-10-16 12:01:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,038 INFO L481 AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions. [2020-10-16 12:01:32,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions. [2020-10-16 12:01:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:01:32,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,041 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:32,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:01:32,042 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:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash -93104110, now seen corresponding path program 1 times [2020-10-16 12:01:32,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157818312] [2020-10-16 12:01:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:32,223 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:32,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157818312] [2020-10-16 12:01:32,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:32,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:32,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242500371] [2020-10-16 12:01:32,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:32,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:32,225 INFO L87 Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 5 states. [2020-10-16 12:01:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,321 INFO L93 Difference]: Finished difference Result 2410 states and 9134 transitions. [2020-10-16 12:01:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:32,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:01:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,333 INFO L225 Difference]: With dead ends: 2410 [2020-10-16 12:01:32,333 INFO L226 Difference]: Without dead ends: 2410 [2020-10-16 12:01:32,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-16 12:01:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-16 12:01:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-16 12:01:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-10-16 12:01:32,417 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15 [2020-10-16 12:01:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,418 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-10-16 12:01:32,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-10-16 12:01:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:32,422 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,422 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:32,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:01:32,422 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:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2046082702, now seen corresponding path program 1 times [2020-10-16 12:01:32,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309374619] [2020-10-16 12:01:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:32,520 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:32,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309374619] [2020-10-16 12:01:32,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:32,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:32,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249701120] [2020-10-16 12:01:32,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:32,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:32,523 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states. [2020-10-16 12:01:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,628 INFO L93 Difference]: Finished difference Result 2610 states and 9960 transitions. [2020-10-16 12:01:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:32,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:01:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,640 INFO L225 Difference]: With dead ends: 2610 [2020-10-16 12:01:32,641 INFO L226 Difference]: Without dead ends: 2610 [2020-10-16 12:01:32,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-16 12:01:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-16 12:01:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-16 12:01:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions. [2020-10-16 12:01:32,729 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16 [2020-10-16 12:01:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,729 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions. [2020-10-16 12:01:32,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions. [2020-10-16 12:01:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:32,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,736 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:32,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:01:32,736 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:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1696833598, now seen corresponding path program 2 times [2020-10-16 12:01:32,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627153520] [2020-10-16 12:01:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:32,836 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:32,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627153520] [2020-10-16 12:01:32,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:32,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:32,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399046940] [2020-10-16 12:01:32,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:32,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:32,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:32,838 INFO L87 Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states. [2020-10-16 12:01:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,987 INFO L93 Difference]: Finished difference Result 2970 states and 11282 transitions. [2020-10-16 12:01:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:32,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:01:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,998 INFO L225 Difference]: With dead ends: 2970 [2020-10-16 12:01:32,998 INFO L226 Difference]: Without dead ends: 2970 [2020-10-16 12:01:32,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-10-16 12:01:33,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2762. [2020-10-16 12:01:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-16 12:01:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10430 transitions. [2020-10-16 12:01:33,098 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10430 transitions. Word has length 16 [2020-10-16 12:01:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:33,099 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10430 transitions. [2020-10-16 12:01:33,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10430 transitions. [2020-10-16 12:01:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:01:33,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:33,107 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:33,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:01:33,108 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:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -112806921, now seen corresponding path program 1 times [2020-10-16 12:01:33,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:33,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148377060] [2020-10-16 12:01:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:33,295 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:33,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148377060] [2020-10-16 12:01:33,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:33,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:33,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74158780] [2020-10-16 12:01:33,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:33,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:33,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:33,297 INFO L87 Difference]: Start difference. First operand 2762 states and 10430 transitions. Second operand 7 states. [2020-10-16 12:01:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:33,546 INFO L93 Difference]: Finished difference Result 3362 states and 12748 transitions. [2020-10-16 12:01:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:01:33,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 12:01:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:33,559 INFO L225 Difference]: With dead ends: 3362 [2020-10-16 12:01:33,559 INFO L226 Difference]: Without dead ends: 3362 [2020-10-16 12:01:33,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:01:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2020-10-16 12:01:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 2962. [2020-10-16 12:01:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2962 states. [2020-10-16 12:01:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 11256 transitions. [2020-10-16 12:01:33,664 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 11256 transitions. Word has length 17 [2020-10-16 12:01:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:33,664 INFO L481 AbstractCegarLoop]: Abstraction has 2962 states and 11256 transitions. [2020-10-16 12:01:33,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 11256 transitions. [2020-10-16 12:01:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:01:33,670 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:33,670 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:33,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:01:33,671 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:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1063517833, now seen corresponding path program 2 times [2020-10-16 12:01:33,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:33,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202987740] [2020-10-16 12:01:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:33,802 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:33,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202987740] [2020-10-16 12:01:33,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:33,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:33,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658478071] [2020-10-16 12:01:33,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:33,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:33,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:33,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:33,804 INFO L87 Difference]: Start difference. First operand 2962 states and 11256 transitions. Second operand 7 states. [2020-10-16 12:01:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:33,992 INFO L93 Difference]: Finished difference Result 3082 states and 11638 transitions. [2020-10-16 12:01:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:33,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 12:01:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:34,002 INFO L225 Difference]: With dead ends: 3082 [2020-10-16 12:01:34,002 INFO L226 Difference]: Without dead ends: 3082 [2020-10-16 12:01:34,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:01:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2020-10-16 12:01:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2506. [2020-10-16 12:01:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-16 12:01:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9438 transitions. [2020-10-16 12:01:34,081 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9438 transitions. Word has length 17 [2020-10-16 12:01:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:34,081 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9438 transitions. [2020-10-16 12:01:34,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9438 transitions. [2020-10-16 12:01:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:01:34,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:34,086 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:34,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:01:34,087 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:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 207234097, now seen corresponding path program 1 times [2020-10-16 12:01:34,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:34,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238004249] [2020-10-16 12:01:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:34,183 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:34,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238004249] [2020-10-16 12:01:34,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:34,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:34,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600081725] [2020-10-16 12:01:34,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:34,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:34,185 INFO L87 Difference]: Start difference. First operand 2506 states and 9438 transitions. Second operand 4 states. [2020-10-16 12:01:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:34,254 INFO L93 Difference]: Finished difference Result 2608 states and 8966 transitions. [2020-10-16 12:01:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:34,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-16 12:01:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:34,285 INFO L225 Difference]: With dead ends: 2608 [2020-10-16 12:01:34,285 INFO L226 Difference]: Without dead ends: 1928 [2020-10-16 12:01:34,286 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:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2020-10-16 12:01:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928. [2020-10-16 12:01:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2020-10-16 12:01:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 6548 transitions. [2020-10-16 12:01:34,354 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 6548 transitions. Word has length 17 [2020-10-16 12:01:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:34,354 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 6548 transitions. [2020-10-16 12:01:34,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 6548 transitions. [2020-10-16 12:01:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:01:34,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:34,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:34,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:01:34,361 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:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash -791241669, now seen corresponding path program 1 times [2020-10-16 12:01:34,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:34,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762950485] [2020-10-16 12:01:34,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:34,449 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:34,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762950485] [2020-10-16 12:01:34,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:34,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:34,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605976569] [2020-10-16 12:01:34,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:34,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:34,451 INFO L87 Difference]: Start difference. First operand 1928 states and 6548 transitions. Second operand 5 states. [2020-10-16 12:01:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:34,512 INFO L93 Difference]: Finished difference Result 1677 states and 5264 transitions. [2020-10-16 12:01:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:01:34,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-16 12:01:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:34,518 INFO L225 Difference]: With dead ends: 1677 [2020-10-16 12:01:34,518 INFO L226 Difference]: Without dead ends: 1261 [2020-10-16 12:01:34,518 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:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2020-10-16 12:01:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261. [2020-10-16 12:01:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2020-10-16 12:01:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 3880 transitions. [2020-10-16 12:01:34,548 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 3880 transitions. Word has length 18 [2020-10-16 12:01:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:34,548 INFO L481 AbstractCegarLoop]: Abstraction has 1261 states and 3880 transitions. [2020-10-16 12:01:34,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 3880 transitions. [2020-10-16 12:01:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:01:34,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:34,551 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:34,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:01:34,552 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:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 694225450, now seen corresponding path program 1 times [2020-10-16 12:01:34,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:34,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844985617] [2020-10-16 12:01:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:34,589 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:34,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844985617] [2020-10-16 12:01:34,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:34,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:01:34,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787107772] [2020-10-16 12:01:34,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:34,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:34,591 INFO L87 Difference]: Start difference. First operand 1261 states and 3880 transitions. Second operand 3 states. [2020-10-16 12:01:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:34,607 INFO L93 Difference]: Finished difference Result 1811 states and 5421 transitions. [2020-10-16 12:01:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:34,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-16 12:01:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:34,612 INFO L225 Difference]: With dead ends: 1811 [2020-10-16 12:01:34,612 INFO L226 Difference]: Without dead ends: 1273 [2020-10-16 12:01:34,612 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:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2020-10-16 12:01:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1253. [2020-10-16 12:01:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2020-10-16 12:01:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 3643 transitions. [2020-10-16 12:01:34,697 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 3643 transitions. Word has length 20 [2020-10-16 12:01:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:34,697 INFO L481 AbstractCegarLoop]: Abstraction has 1253 states and 3643 transitions. [2020-10-16 12:01:34,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 3643 transitions. [2020-10-16 12:01:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:01:34,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:34,701 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] [2020-10-16 12:01:34,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:01:34,702 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:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash -905674660, now seen corresponding path program 1 times [2020-10-16 12:01:34,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:34,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229703208] [2020-10-16 12:01:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:34,781 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:34,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229703208] [2020-10-16 12:01:34,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:34,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:34,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978476390] [2020-10-16 12:01:34,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:34,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:34,784 INFO L87 Difference]: Start difference. First operand 1253 states and 3643 transitions. Second operand 6 states. [2020-10-16 12:01:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:34,846 INFO L93 Difference]: Finished difference Result 1111 states and 3191 transitions. [2020-10-16 12:01:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:01:34,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-16 12:01:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:34,850 INFO L225 Difference]: With dead ends: 1111 [2020-10-16 12:01:34,850 INFO L226 Difference]: Without dead ends: 981 [2020-10-16 12:01:34,851 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:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2020-10-16 12:01:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 949. [2020-10-16 12:01:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2020-10-16 12:01:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2767 transitions. [2020-10-16 12:01:34,871 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2767 transitions. Word has length 21 [2020-10-16 12:01:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:34,871 INFO L481 AbstractCegarLoop]: Abstraction has 949 states and 2767 transitions. [2020-10-16 12:01:34,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2767 transitions. [2020-10-16 12:01:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:01:34,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:34,874 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] [2020-10-16 12:01:34,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:01:34,874 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:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash -730235590, now seen corresponding path program 1 times [2020-10-16 12:01:34,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:34,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142197948] [2020-10-16 12:01:34,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:34,975 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:34,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142197948] [2020-10-16 12:01:34,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:34,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:01:34,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628890975] [2020-10-16 12:01:34,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:34,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:34,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:34,978 INFO L87 Difference]: Start difference. First operand 949 states and 2767 transitions. Second operand 7 states. [2020-10-16 12:01:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:35,049 INFO L93 Difference]: Finished difference Result 920 states and 2708 transitions. [2020-10-16 12:01:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:01:35,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 12:01:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:35,052 INFO L225 Difference]: With dead ends: 920 [2020-10-16 12:01:35,052 INFO L226 Difference]: Without dead ends: 565 [2020-10-16 12:01:35,052 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:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-10-16 12:01:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 517. [2020-10-16 12:01:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-16 12:01:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-10-16 12:01:35,063 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 24 [2020-10-16 12:01:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:35,063 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-10-16 12:01:35,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-10-16 12:01:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:35,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:35,065 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:35,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:01:35,066 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:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash -126296697, now seen corresponding path program 1 times [2020-10-16 12:01:35,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:35,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657037520] [2020-10-16 12:01:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:35,116 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:35,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657037520] [2020-10-16 12:01:35,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:35,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:35,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215682798] [2020-10-16 12:01:35,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:35,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:35,118 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 4 states. [2020-10-16 12:01:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:35,134 INFO L93 Difference]: Finished difference Result 684 states and 1931 transitions. [2020-10-16 12:01:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:35,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-16 12:01:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:35,136 INFO L225 Difference]: With dead ends: 684 [2020-10-16 12:01:35,136 INFO L226 Difference]: Without dead ends: 214 [2020-10-16 12:01:35,136 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:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-16 12:01:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-16 12:01:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-16 12:01:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-10-16 12:01:35,141 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2020-10-16 12:01:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:35,141 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-10-16 12:01:35,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-10-16 12:01:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:35,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:35,142 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:35,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:01:35,142 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:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash -666194943, now seen corresponding path program 2 times [2020-10-16 12:01:35,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:35,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427801709] [2020-10-16 12:01:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:35,265 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:35,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427801709] [2020-10-16 12:01:35,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:35,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:35,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20760626] [2020-10-16 12:01:35,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:35,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:35,267 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 7 states. [2020-10-16 12:01:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:35,348 INFO L93 Difference]: Finished difference Result 300 states and 761 transitions. [2020-10-16 12:01:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:35,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-16 12:01:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:35,350 INFO L225 Difference]: With dead ends: 300 [2020-10-16 12:01:35,350 INFO L226 Difference]: Without dead ends: 250 [2020-10-16 12:01:35,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:01:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-16 12:01:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2020-10-16 12:01:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-16 12:01:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 463 transitions. [2020-10-16 12:01:35,355 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 463 transitions. Word has length 27 [2020-10-16 12:01:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:35,356 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 463 transitions. [2020-10-16 12:01:35,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 463 transitions. [2020-10-16 12:01:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:35,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:35,357 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:35,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:01:35,357 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:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1827165113, now seen corresponding path program 3 times [2020-10-16 12:01:35,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:35,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511517836] [2020-10-16 12:01:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:35,520 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:35,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511517836] [2020-10-16 12:01:35,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:35,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:35,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689121089] [2020-10-16 12:01:35,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:35,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:35,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:35,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:35,522 INFO L87 Difference]: Start difference. First operand 190 states and 463 transitions. Second operand 7 states. [2020-10-16 12:01:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:35,692 INFO L93 Difference]: Finished difference Result 264 states and 645 transitions. [2020-10-16 12:01:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:01:35,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-16 12:01:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:35,694 INFO L225 Difference]: With dead ends: 264 [2020-10-16 12:01:35,694 INFO L226 Difference]: Without dead ends: 204 [2020-10-16 12:01:35,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:01:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-16 12:01:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168. [2020-10-16 12:01:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-16 12:01:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-10-16 12:01:35,699 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-10-16 12:01:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:35,699 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-10-16 12:01:35,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-10-16 12:01:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:35,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:35,700 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:35,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:01:35,701 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1540373759, now seen corresponding path program 4 times [2020-10-16 12:01:35,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:35,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755893766] [2020-10-16 12:01:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:01:35,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:01:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:01:35,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:01:35,859 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:01:35,859 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:01:35,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:01:35,861 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:01:35,885 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L2-->L851: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-239951647 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-239951647 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-239951647 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-239951647 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (or (and .cse0 (= ~y~0_Out-239951647 ~y~0_In-239951647)) (and (= ~y~0_Out-239951647 ~y$w_buff1~0_In-239951647) .cse1 .cse2)) .cse3) (and (= ~y~0_Out-239951647 ~y$w_buff0~0_In-239951647) .cse4 .cse5)) (= ~y$r_buff1_thd0~0_Out-239951647 ~y$r_buff1_thd0~0_In-239951647) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-239951647 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-239951647|) (or (and (= ~y$w_buff1_used~0_Out-239951647 ~y$w_buff1_used~0_In-239951647) .cse0) (and (= ~y$w_buff1_used~0_Out-239951647 0) .cse1 .cse2)) (or (and (= ~y$w_buff0_used~0_In-239951647 ~y$w_buff0_used~0_Out-239951647) .cse3) (and (= ~y$w_buff0_used~0_Out-239951647 0) .cse4 .cse5)) (= ~y$r_buff0_thd0~0_In-239951647 ~y$r_buff0_thd0~0_Out-239951647) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-239951647 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-239951647|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-239951647, ~y$w_buff1~0=~y$w_buff1~0_In-239951647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239951647, ~y$w_buff0~0=~y$w_buff0~0_In-239951647, ~y~0=~y~0_In-239951647, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239951647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239951647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-239951647, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-239951647|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-239951647|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-239951647|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-239951647|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-239951647|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-239951647|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-239951647|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-239951647, ~y$w_buff1~0=~y$w_buff1~0_In-239951647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-239951647, ~y$w_buff0~0=~y$w_buff0~0_In-239951647, ~y~0=~y~0_Out-239951647, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-239951647, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-239951647} 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:35,899 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:35,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,900 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:35,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,901 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:35,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,901 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:35,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,901 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:35,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,901 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:35,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,903 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:35,903 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,906 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:35,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,906 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:35,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,906 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:35,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,907 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:35,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,907 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:35,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,907 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:35,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,908 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:35,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,908 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:35,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,908 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:35,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,909 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:35,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,909 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:35,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,914 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:35,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,915 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:35,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,915 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:35,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,915 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:35,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,916 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:35,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,916 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:35,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,917 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:35,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,917 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:35,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,917 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:35,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,918 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:35,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,918 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:35,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,918 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:35,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:35,918 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:35,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:36,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:36 BasicIcfg [2020-10-16 12:01:36,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:01:36,035 INFO L168 Benchmark]: Toolchain (without parser) took 17713.85 ms. Allocated memory was 141.0 MB in the beginning and 476.6 MB in the end (delta: 335.5 MB). Free memory was 102.8 MB in the beginning and 157.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 280.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:36,036 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-16 12:01:36,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.64 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 102.5 MB in the beginning and 156.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:36,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.15 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:36,037 INFO L168 Benchmark]: Boogie Preprocessor took 44.04 ms. Allocated memory is still 202.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:36,038 INFO L168 Benchmark]: RCFGBuilder took 2144.08 ms. Allocated memory was 202.4 MB in the beginning and 245.4 MB in the end (delta: 43.0 MB). Free memory was 151.5 MB in the beginning and 158.9 MB in the end (delta: -7.3 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:36,038 INFO L168 Benchmark]: TraceAbstraction took 14572.62 ms. Allocated memory was 245.4 MB in the beginning and 476.6 MB in the end (delta: 231.2 MB). Free memory was 157.2 MB in the beginning and 157.9 MB in the end (delta: -724.6 kB). Peak memory consumption was 230.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:36,041 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.46 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.64 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 102.5 MB in the beginning and 156.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.15 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.04 ms. Allocated memory is still 202.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2144.08 ms. Allocated memory was 202.4 MB in the beginning and 245.4 MB in the end (delta: 43.0 MB). Free memory was 151.5 MB in the beginning and 158.9 MB in the end (delta: -7.3 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14572.62 ms. Allocated memory was 245.4 MB in the beginning and 476.6 MB in the end (delta: 231.2 MB). Free memory was 157.2 MB in the beginning and 157.9 MB in the end (delta: -724.6 kB). Peak memory consumption was 230.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1339 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 131 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.6s, 121 PlacesBefore, 46 PlacesAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 7068 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_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff0_thd4; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$r_buff1_thd4; [L724] 0 _Bool y$read_delayed; [L725] 0 int *y$read_delayed_var; [L726] 0 int y$w_buff0; [L727] 0 _Bool y$w_buff0_used; [L728] 0 int y$w_buff1; [L729] 0 _Bool y$w_buff1_used; [L731] 0 int z = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t813; [L834] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L835] 0 pthread_t t814; [L836] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, 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 t815; [L838] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, 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] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 2 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L777] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L778] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L779] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L780] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L781] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L782] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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] [L785] 3 z = 1 VAL [__unbuffered_cnt=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=1] [L839] 0 pthread_t t816; [L840] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L802] 4 z = 2 VAL [__unbuffered_cnt=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] [L805] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=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] [L808] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=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] [L811] 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) [L811] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L811] 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) [L811] 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) [L812] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L812] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L813] 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 [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L814] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L815] 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 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L737] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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] [L740] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=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] [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L758] 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) [L758] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L758] 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) [L758] 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) [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 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 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 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 [L788] 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) [L788] 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) [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L790] 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 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L792] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L765] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 2 return 0; [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] 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) [L857] 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) [L858] 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)) [L858] EXPR 0 !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) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L858] EXPR 0 !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) [L858] 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)) [L858] 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)) [L859] 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)) [L859] 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)) [L860] 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)) [L860] EXPR 0 !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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] EXPR 0 !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) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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) [L863] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 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_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=2, 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, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 659 SDtfs, 898 SDslu, 1063 SDs, 0 SdLazy, 487 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s 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, 20 MinimizatonAttempts, 1420 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 49822 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...