/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:01:47,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:01:47,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:01:47,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:01:47,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:01:47,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:01:47,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:01:47,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:01:47,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:01:47,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:01:47,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:01:47,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:01:47,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:01:47,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:01:47,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:01:47,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:01:47,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:01:47,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:01:47,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:01:47,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:01:47,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:01:47,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:01:47,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:01:47,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:01:47,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:01:47,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:01:47,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:01:47,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:01:47,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:01:47,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:01:47,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:01:47,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:01:47,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:01:47,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:01:47,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:01:47,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:01:47,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:01:47,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:01:47,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:01:47,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:01:47,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:01:47,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:01:47,974 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:01:47,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:01:47,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:01:47,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:01:47,977 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:01:47,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:01:47,977 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:01:47,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:01:47,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:01:47,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:01:47,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:01:47,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:01:47,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:01:47,980 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:01:47,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:01:47,980 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:01:47,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:01:47,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:01:47,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:01:47,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:01:47,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:01:47,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:47,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:01:47,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:01:47,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:01:47,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:01:47,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:01:47,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:01:47,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:01:48,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:01:48,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:01:48,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:01:48,312 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:01:48,312 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:01:48,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-21 23:01:48,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c8e97db/6f36ac84915a4e8eb801c6b3afe9d8b6/FLAG0f68a723e [2020-10-21 23:01:48,985 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:01:48,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-21 23:01:49,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c8e97db/6f36ac84915a4e8eb801c6b3afe9d8b6/FLAG0f68a723e [2020-10-21 23:01:49,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c8e97db/6f36ac84915a4e8eb801c6b3afe9d8b6 [2020-10-21 23:01:49,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:01:49,363 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:01:49,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:49,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:01:49,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:01:49,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:49" (1/1) ... [2020-10-21 23:01:49,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38bf2dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:49, skipping insertion in model container [2020-10-21 23:01:49,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:49" (1/1) ... [2020-10-21 23:01:49,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:01:49,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:01:50,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:50,081 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:01:50,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:50,221 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:01:50,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50 WrapperNode [2020-10-21 23:01:50,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:50,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:50,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:01:50,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:01:50,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:50,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:01:50,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:01:50,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:01:50,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... [2020-10-21 23:01:50,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:01:50,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:01:50,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:01:50,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:01:50,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:01:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:01:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:01:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:01:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:01:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:01:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:01:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:01:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:01:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:01:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:01:50,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:01:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:01:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:01:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:01:50,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:01:50,412 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:01:52,368 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:01:52,369 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:01:52,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:52 BoogieIcfgContainer [2020-10-21 23:01:52,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:01:52,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:01:52,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:01:52,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:01:52,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:01:49" (1/3) ... [2020-10-21 23:01:52,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a61929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:52, skipping insertion in model container [2020-10-21 23:01:52,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:50" (2/3) ... [2020-10-21 23:01:52,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a61929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:52, skipping insertion in model container [2020-10-21 23:01:52,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:52" (3/3) ... [2020-10-21 23:01:52,379 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2020-10-21 23:01:52,390 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:01:52,391 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:01:52,399 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:01:52,400 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:01:52,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,437 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,437 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,439 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,446 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,447 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,448 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,458 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,458 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:52,460 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:01:52,476 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:01:52,504 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:01:52,504 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:01:52,504 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:01:52,504 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:01:52,504 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:01:52,505 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:01:52,505 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:01:52,505 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:01:52,521 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:01:52,523 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-21 23:01:52,527 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-21 23:01:52,530 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-10-21 23:01:52,591 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-10-21 23:01:52,592 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:01:52,597 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-21 23:01:52,601 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-10-21 23:01:53,316 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:01:54,731 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-21 23:01:55,980 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-21 23:01:56,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:01:56,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:56,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:01:56,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:57,004 WARN L193 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-10-21 23:01:58,088 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-21 23:01:58,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:01:58,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:58,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:01:58,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:59,125 WARN L193 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2020-10-21 23:01:59,251 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-21 23:01:59,359 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-21 23:01:59,814 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-21 23:01:59,997 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-21 23:02:01,877 WARN L193 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 247 DAG size of output: 206 [2020-10-21 23:02:01,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 23:02:01,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:02:01,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:02:01,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:02:03,498 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 163 DAG size of output: 134 [2020-10-21 23:02:03,544 INFO L131 LiptonReduction]: Checked pairs total: 7247 [2020-10-21 23:02:03,544 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 23:02:03,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-21 23:02:03,739 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-21 23:02:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-21 23:02:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:02:03,758 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:03,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:03,760 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 477405012, now seen corresponding path program 1 times [2020-10-21 23:02:03,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:03,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387287798] [2020-10-21 23:02:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:04,105 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-21 23:02:04,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387287798] [2020-10-21 23:02:04,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:04,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:02:04,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831875535] [2020-10-21 23:02:04,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:04,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:04,132 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-21 23:02:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:04,262 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-21 23:02:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:04,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:02:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:04,304 INFO L225 Difference]: With dead ends: 2202 [2020-10-21 23:02:04,304 INFO L226 Difference]: Without dead ends: 1802 [2020-10-21 23:02:04,306 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-21 23:02:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-21 23:02:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-21 23:02:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-21 23:02:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-21 23:02:04,462 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-21 23:02:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:04,464 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-21 23:02:04,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-21 23:02:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:02:04,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:04,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:04,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:02:04,468 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash -775206985, now seen corresponding path program 1 times [2020-10-21 23:02:04,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:04,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7542673] [2020-10-21 23:02:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:04,680 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-21 23:02:04,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7542673] [2020-10-21 23:02:04,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:04,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:02:04,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000940569] [2020-10-21 23:02:04,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:04,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:04,684 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-21 23:02:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:04,727 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2020-10-21 23:02:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:04,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:02:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:04,745 INFO L225 Difference]: With dead ends: 1752 [2020-10-21 23:02:04,745 INFO L226 Difference]: Without dead ends: 1752 [2020-10-21 23:02:04,746 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-21 23:02:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2020-10-21 23:02:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-10-21 23:02:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-10-21 23:02:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2020-10-21 23:02:04,882 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2020-10-21 23:02:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:04,883 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2020-10-21 23:02:04,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2020-10-21 23:02:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:02:04,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:04,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:04,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:02:04,886 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash 382188627, now seen corresponding path program 1 times [2020-10-21 23:02:04,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:04,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932579376] [2020-10-21 23:02:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:04,961 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-21 23:02:04,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932579376] [2020-10-21 23:02:04,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:04,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:02:04,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654151378] [2020-10-21 23:02:04,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:04,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:04,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:04,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:04,964 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand 3 states. [2020-10-21 23:02:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:05,008 INFO L93 Difference]: Finished difference Result 1722 states and 6420 transitions. [2020-10-21 23:02:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:05,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 23:02:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:05,025 INFO L225 Difference]: With dead ends: 1722 [2020-10-21 23:02:05,025 INFO L226 Difference]: Without dead ends: 1722 [2020-10-21 23:02:05,025 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-21 23:02:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-10-21 23:02:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2020-10-21 23:02:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-10-21 23:02:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6420 transitions. [2020-10-21 23:02:05,093 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6420 transitions. Word has length 12 [2020-10-21 23:02:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:05,093 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6420 transitions. [2020-10-21 23:02:05,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6420 transitions. [2020-10-21 23:02:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:02:05,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:05,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:05,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:02:05,096 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:05,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:05,097 INFO L82 PathProgramCache]: Analyzing trace with hash -709915685, now seen corresponding path program 1 times [2020-10-21 23:02:05,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:05,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128457803] [2020-10-21 23:02:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:05,146 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-21 23:02:05,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128457803] [2020-10-21 23:02:05,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:05,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:02:05,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143929500] [2020-10-21 23:02:05,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:05,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:05,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:05,149 INFO L87 Difference]: Start difference. First operand 1722 states and 6420 transitions. Second operand 3 states. [2020-10-21 23:02:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:05,198 INFO L93 Difference]: Finished difference Result 2386 states and 8562 transitions. [2020-10-21 23:02:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:05,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-21 23:02:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:05,220 INFO L225 Difference]: With dead ends: 2386 [2020-10-21 23:02:05,220 INFO L226 Difference]: Without dead ends: 1842 [2020-10-21 23:02:05,221 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-21 23:02:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2020-10-21 23:02:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1682. [2020-10-21 23:02:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-10-21 23:02:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 5986 transitions. [2020-10-21 23:02:05,306 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 5986 transitions. Word has length 13 [2020-10-21 23:02:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:05,307 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 5986 transitions. [2020-10-21 23:02:05,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 5986 transitions. [2020-10-21 23:02:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:02:05,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:05,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:05,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:02:05,310 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1037055385, now seen corresponding path program 1 times [2020-10-21 23:02:05,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:05,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007838980] [2020-10-21 23:02:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:05,466 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-21 23:02:05,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007838980] [2020-10-21 23:02:05,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:05,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:02:05,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349227849] [2020-10-21 23:02:05,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:02:05,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:05,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:02:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:05,470 INFO L87 Difference]: Start difference. First operand 1682 states and 5986 transitions. Second operand 4 states. [2020-10-21 23:02:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:05,527 INFO L93 Difference]: Finished difference Result 1668 states and 5924 transitions. [2020-10-21 23:02:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:05,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:02:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:05,543 INFO L225 Difference]: With dead ends: 1668 [2020-10-21 23:02:05,543 INFO L226 Difference]: Without dead ends: 1668 [2020-10-21 23:02:05,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-10-21 23:02:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-10-21 23:02:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-10-21 23:02:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 5924 transitions. [2020-10-21 23:02:05,610 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 5924 transitions. Word has length 13 [2020-10-21 23:02:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:05,610 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 5924 transitions. [2020-10-21 23:02:05,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:02:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 5924 transitions. [2020-10-21 23:02:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:02:05,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:05,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:05,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:02:05,614 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2127906781, now seen corresponding path program 1 times [2020-10-21 23:02:05,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:05,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893545325] [2020-10-21 23:02:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:05,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893545325] [2020-10-21 23:02:05,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:05,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:05,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351355913] [2020-10-21 23:02:05,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:02:05,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:02:05,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:05,813 INFO L87 Difference]: Start difference. First operand 1668 states and 5924 transitions. Second operand 5 states. [2020-10-21 23:02:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:05,924 INFO L93 Difference]: Finished difference Result 1814 states and 6454 transitions. [2020-10-21 23:02:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:02:05,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:02:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:05,940 INFO L225 Difference]: With dead ends: 1814 [2020-10-21 23:02:05,940 INFO L226 Difference]: Without dead ends: 1814 [2020-10-21 23:02:05,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:02:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2020-10-21 23:02:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1814. [2020-10-21 23:02:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2020-10-21 23:02:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 6454 transitions. [2020-10-21 23:02:06,004 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 6454 transitions. Word has length 14 [2020-10-21 23:02:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:06,005 INFO L481 AbstractCegarLoop]: Abstraction has 1814 states and 6454 transitions. [2020-10-21 23:02:06,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:02:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 6454 transitions. [2020-10-21 23:02:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:02:06,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:06,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:06,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:02:06,008 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2083941031, now seen corresponding path program 2 times [2020-10-21 23:02:06,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:06,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826656246] [2020-10-21 23:02:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:06,121 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-21 23:02:06,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826656246] [2020-10-21 23:02:06,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:06,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:06,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804304249] [2020-10-21 23:02:06,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:02:06,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:02:06,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:06,124 INFO L87 Difference]: Start difference. First operand 1814 states and 6454 transitions. Second operand 5 states. [2020-10-21 23:02:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:06,194 INFO L93 Difference]: Finished difference Result 1786 states and 6330 transitions. [2020-10-21 23:02:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:06,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:02:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:06,210 INFO L225 Difference]: With dead ends: 1786 [2020-10-21 23:02:06,210 INFO L226 Difference]: Without dead ends: 1786 [2020-10-21 23:02:06,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2020-10-21 23:02:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2020-10-21 23:02:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-10-21 23:02:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 6330 transitions. [2020-10-21 23:02:06,272 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 6330 transitions. Word has length 14 [2020-10-21 23:02:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:06,272 INFO L481 AbstractCegarLoop]: Abstraction has 1786 states and 6330 transitions. [2020-10-21 23:02:06,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:02:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 6330 transitions. [2020-10-21 23:02:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:02:06,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:06,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:06,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:02:06,276 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:06,277 INFO L82 PathProgramCache]: Analyzing trace with hash -177664943, now seen corresponding path program 1 times [2020-10-21 23:02:06,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:06,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283800635] [2020-10-21 23:02:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:06,466 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-21 23:02:06,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283800635] [2020-10-21 23:02:06,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:06,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:06,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868843065] [2020-10-21 23:02:06,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:02:06,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:02:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:06,469 INFO L87 Difference]: Start difference. First operand 1786 states and 6330 transitions. Second operand 5 states. [2020-10-21 23:02:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:06,549 INFO L93 Difference]: Finished difference Result 1882 states and 6616 transitions. [2020-10-21 23:02:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:06,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:02:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:06,566 INFO L225 Difference]: With dead ends: 1882 [2020-10-21 23:02:06,566 INFO L226 Difference]: Without dead ends: 1882 [2020-10-21 23:02:06,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-10-21 23:02:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1694. [2020-10-21 23:02:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-10-21 23:02:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 5942 transitions. [2020-10-21 23:02:06,626 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 5942 transitions. Word has length 15 [2020-10-21 23:02:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:06,627 INFO L481 AbstractCegarLoop]: Abstraction has 1694 states and 5942 transitions. [2020-10-21 23:02:06,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:02:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 5942 transitions. [2020-10-21 23:02:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:02:06,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:06,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:06,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:02:06,630 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash -177889786, now seen corresponding path program 1 times [2020-10-21 23:02:06,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:06,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914858521] [2020-10-21 23:02:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:06,726 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-21 23:02:06,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914858521] [2020-10-21 23:02:06,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:06,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:06,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604690207] [2020-10-21 23:02:06,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:02:06,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:02:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:06,729 INFO L87 Difference]: Start difference. First operand 1694 states and 5942 transitions. Second operand 5 states. [2020-10-21 23:02:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:06,805 INFO L93 Difference]: Finished difference Result 1742 states and 6082 transitions. [2020-10-21 23:02:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:06,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:02:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:06,815 INFO L225 Difference]: With dead ends: 1742 [2020-10-21 23:02:06,815 INFO L226 Difference]: Without dead ends: 1742 [2020-10-21 23:02:06,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2020-10-21 23:02:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2020-10-21 23:02:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-10-21 23:02:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 6082 transitions. [2020-10-21 23:02:06,868 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 6082 transitions. Word has length 15 [2020-10-21 23:02:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:06,869 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 6082 transitions. [2020-10-21 23:02:06,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:02:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 6082 transitions. [2020-10-21 23:02:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:02:06,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:06,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:06,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:02:06,873 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash -218943706, now seen corresponding path program 2 times [2020-10-21 23:02:06,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:06,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851060040] [2020-10-21 23:02:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,143 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-21 23:02:07,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851060040] [2020-10-21 23:02:07,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:02:07,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288919602] [2020-10-21 23:02:07,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:02:07,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:02:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:02:07,146 INFO L87 Difference]: Start difference. First operand 1742 states and 6082 transitions. Second operand 6 states. [2020-10-21 23:02:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,248 INFO L93 Difference]: Finished difference Result 1714 states and 5972 transitions. [2020-10-21 23:02:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:07,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 23:02:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,256 INFO L225 Difference]: With dead ends: 1714 [2020-10-21 23:02:07,256 INFO L226 Difference]: Without dead ends: 1714 [2020-10-21 23:02:07,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2020-10-21 23:02:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1666. [2020-10-21 23:02:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2020-10-21 23:02:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 5832 transitions. [2020-10-21 23:02:07,306 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 5832 transitions. Word has length 15 [2020-10-21 23:02:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,306 INFO L481 AbstractCegarLoop]: Abstraction has 1666 states and 5832 transitions. [2020-10-21 23:02:07,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:02:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 5832 transitions. [2020-10-21 23:02:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:02:07,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:02:07,311 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash -591786302, now seen corresponding path program 1 times [2020-10-21 23:02:07,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353145686] [2020-10-21 23:02:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,383 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-21 23:02:07,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353145686] [2020-10-21 23:02:07,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:07,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362016503] [2020-10-21 23:02:07,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:02:07,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:02:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:07,385 INFO L87 Difference]: Start difference. First operand 1666 states and 5832 transitions. Second operand 4 states. [2020-10-21 23:02:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,446 INFO L93 Difference]: Finished difference Result 1757 states and 5606 transitions. [2020-10-21 23:02:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:02:07,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 23:02:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,453 INFO L225 Difference]: With dead ends: 1757 [2020-10-21 23:02:07,453 INFO L226 Difference]: Without dead ends: 1325 [2020-10-21 23:02:07,453 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-21 23:02:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2020-10-21 23:02:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2020-10-21 23:02:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2020-10-21 23:02:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4205 transitions. [2020-10-21 23:02:07,492 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 4205 transitions. Word has length 16 [2020-10-21 23:02:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,492 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 4205 transitions. [2020-10-21 23:02:07,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:02:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 4205 transitions. [2020-10-21 23:02:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:02:07,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:02:07,496 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1393825750, now seen corresponding path program 1 times [2020-10-21 23:02:07,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405232778] [2020-10-21 23:02:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,576 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-21 23:02:07,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405232778] [2020-10-21 23:02:07,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:02:07,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558479924] [2020-10-21 23:02:07,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:02:07,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:02:07,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:07,578 INFO L87 Difference]: Start difference. First operand 1325 states and 4205 transitions. Second operand 5 states. [2020-10-21 23:02:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,640 INFO L93 Difference]: Finished difference Result 1166 states and 3385 transitions. [2020-10-21 23:02:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:02:07,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-21 23:02:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,644 INFO L225 Difference]: With dead ends: 1166 [2020-10-21 23:02:07,644 INFO L226 Difference]: Without dead ends: 887 [2020-10-21 23:02:07,645 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-21 23:02:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-21 23:02:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2020-10-21 23:02:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2020-10-21 23:02:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2527 transitions. [2020-10-21 23:02:07,667 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 2527 transitions. Word has length 17 [2020-10-21 23:02:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,667 INFO L481 AbstractCegarLoop]: Abstraction has 887 states and 2527 transitions. [2020-10-21 23:02:07,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:02:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 2527 transitions. [2020-10-21 23:02:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:02:07,670 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:02:07,670 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -232445824, now seen corresponding path program 1 times [2020-10-21 23:02:07,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292617542] [2020-10-21 23:02:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,716 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-21 23:02:07,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292617542] [2020-10-21 23:02:07,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:07,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271903052] [2020-10-21 23:02:07,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:02:07,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:02:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:07,718 INFO L87 Difference]: Start difference. First operand 887 states and 2527 transitions. Second operand 4 states. [2020-10-21 23:02:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,742 INFO L93 Difference]: Finished difference Result 1238 states and 3438 transitions. [2020-10-21 23:02:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:07,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-21 23:02:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,746 INFO L225 Difference]: With dead ends: 1238 [2020-10-21 23:02:07,746 INFO L226 Difference]: Without dead ends: 908 [2020-10-21 23:02:07,746 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-21 23:02:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2020-10-21 23:02:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 887. [2020-10-21 23:02:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2020-10-21 23:02:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2447 transitions. [2020-10-21 23:02:07,770 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 2447 transitions. Word has length 19 [2020-10-21 23:02:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,770 INFO L481 AbstractCegarLoop]: Abstraction has 887 states and 2447 transitions. [2020-10-21 23:02:07,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:02:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 2447 transitions. [2020-10-21 23:02:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:02:07,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:02:07,774 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,774 INFO L82 PathProgramCache]: Analyzing trace with hash 586023615, now seen corresponding path program 1 times [2020-10-21 23:02:07,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741071613] [2020-10-21 23:02:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,815 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-21 23:02:07,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741071613] [2020-10-21 23:02:07,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:02:07,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270501497] [2020-10-21 23:02:07,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:07,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:07,817 INFO L87 Difference]: Start difference. First operand 887 states and 2447 transitions. Second operand 3 states. [2020-10-21 23:02:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,833 INFO L93 Difference]: Finished difference Result 1249 states and 3300 transitions. [2020-10-21 23:02:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:07,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-21 23:02:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,837 INFO L225 Difference]: With dead ends: 1249 [2020-10-21 23:02:07,838 INFO L226 Difference]: Without dead ends: 881 [2020-10-21 23:02:07,838 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-21 23:02:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2020-10-21 23:02:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 859. [2020-10-21 23:02:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2020-10-21 23:02:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2215 transitions. [2020-10-21 23:02:07,864 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2215 transitions. Word has length 19 [2020-10-21 23:02:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,864 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 2215 transitions. [2020-10-21 23:02:07,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2215 transitions. [2020-10-21 23:02:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:02:07,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:02:07,868 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 106051531, now seen corresponding path program 1 times [2020-10-21 23:02:07,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570962968] [2020-10-21 23:02:07,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,996 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-21 23:02:07,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570962968] [2020-10-21 23:02:07,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:02:07,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460805139] [2020-10-21 23:02:07,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:02:07,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:02:07,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:02:07,998 INFO L87 Difference]: Start difference. First operand 859 states and 2215 transitions. Second operand 6 states. [2020-10-21 23:02:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:08,076 INFO L93 Difference]: Finished difference Result 754 states and 1895 transitions. [2020-10-21 23:02:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:02:08,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 23:02:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:08,079 INFO L225 Difference]: With dead ends: 754 [2020-10-21 23:02:08,079 INFO L226 Difference]: Without dead ends: 488 [2020-10-21 23:02:08,080 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-21 23:02:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-10-21 23:02:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 468. [2020-10-21 23:02:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-10-21 23:02:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1105 transitions. [2020-10-21 23:02:08,093 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1105 transitions. Word has length 19 [2020-10-21 23:02:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:08,093 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 1105 transitions. [2020-10-21 23:02:08,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:02:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1105 transitions. [2020-10-21 23:02:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:02:08,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:08,095 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] [2020-10-21 23:02:08,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:02:08,096 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1722088816, now seen corresponding path program 1 times [2020-10-21 23:02:08,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:08,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150468557] [2020-10-21 23:02:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:08,283 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-21 23:02:08,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150468557] [2020-10-21 23:02:08,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:08,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:02:08,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599551096] [2020-10-21 23:02:08,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:02:08,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:02:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:08,289 INFO L87 Difference]: Start difference. First operand 468 states and 1105 transitions. Second operand 7 states. [2020-10-21 23:02:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:08,396 INFO L93 Difference]: Finished difference Result 601 states and 1373 transitions. [2020-10-21 23:02:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:02:08,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:02:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:08,399 INFO L225 Difference]: With dead ends: 601 [2020-10-21 23:02:08,399 INFO L226 Difference]: Without dead ends: 438 [2020-10-21 23:02:08,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:02:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-21 23:02:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 409. [2020-10-21 23:02:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-10-21 23:02:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 911 transitions. [2020-10-21 23:02:08,410 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 911 transitions. Word has length 22 [2020-10-21 23:02:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:08,411 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 911 transitions. [2020-10-21 23:02:08,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:02:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 911 transitions. [2020-10-21 23:02:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:02:08,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:08,416 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] [2020-10-21 23:02:08,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:02:08,416 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash 887034598, now seen corresponding path program 2 times [2020-10-21 23:02:08,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:08,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651975325] [2020-10-21 23:02:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:08,649 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-21 23:02:08,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651975325] [2020-10-21 23:02:08,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:08,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:02:08,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598056081] [2020-10-21 23:02:08,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:02:08,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:02:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:08,651 INFO L87 Difference]: Start difference. First operand 409 states and 911 transitions. Second operand 7 states. [2020-10-21 23:02:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:08,754 INFO L93 Difference]: Finished difference Result 446 states and 1006 transitions. [2020-10-21 23:02:08,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:02:08,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:02:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:08,758 INFO L225 Difference]: With dead ends: 446 [2020-10-21 23:02:08,758 INFO L226 Difference]: Without dead ends: 335 [2020-10-21 23:02:08,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-10-21 23:02:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 296. [2020-10-21 23:02:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-21 23:02:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-10-21 23:02:08,768 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 22 [2020-10-21 23:02:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:08,768 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-10-21 23:02:08,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:02:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-10-21 23:02:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:02:08,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:08,770 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] [2020-10-21 23:02:08,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:02:08,771 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2144444351, now seen corresponding path program 1 times [2020-10-21 23:02:08,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:08,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132646463] [2020-10-21 23:02:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:08,930 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-21 23:02:08,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132646463] [2020-10-21 23:02:08,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:08,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:02:08,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577080148] [2020-10-21 23:02:08,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:02:08,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:08,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:02:08,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:08,935 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 7 states. [2020-10-21 23:02:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:09,012 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-10-21 23:02:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:02:09,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:02:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:09,013 INFO L225 Difference]: With dead ends: 276 [2020-10-21 23:02:09,013 INFO L226 Difference]: Without dead ends: 63 [2020-10-21 23:02:09,014 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-21 23:02:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-21 23:02:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-21 23:02:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-21 23:02:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-10-21 23:02:09,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-10-21 23:02:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:09,016 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-10-21 23:02:09,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:02:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-10-21 23:02:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 23:02:09,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:09,017 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] [2020-10-21 23:02:09,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:02:09,017 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 81887815, now seen corresponding path program 1 times [2020-10-21 23:02:09,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:09,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680056031] [2020-10-21 23:02:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:02:09,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:02:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:02:09,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:02:09,166 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:02:09,166 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:02:09,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:02:09,168 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:02:09,189 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L3-->L852: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In1744048728 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In1744048728 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In1744048728 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1744048728 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In1744048728 ~z$r_buff0_thd0~0_Out1744048728) (or (and (= ~z$w_buff1_used~0_Out1744048728 0) .cse0 .cse1) (and (= ~z$w_buff1_used~0_Out1744048728 ~z$w_buff1_used~0_In1744048728) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1744048728 0)) (or (and (or (and (= ~z$w_buff1~0_In1744048728 ~z~0_Out1744048728) .cse0 .cse1) (and (= ~z~0_In1744048728 ~z~0_Out1744048728) .cse2)) .cse3) (and .cse4 .cse5 (= ~z~0_Out1744048728 ~z$w_buff0~0_In1744048728))) (or (and .cse4 (= ~z$w_buff0_used~0_Out1744048728 0) .cse5) (and (= ~z$w_buff0_used~0_In1744048728 ~z$w_buff0_used~0_Out1744048728) .cse3)) (= ~z$r_buff1_thd0~0_Out1744048728 ~z$r_buff1_thd0~0_In1744048728)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1744048728, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1744048728, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1744048728, ~z$w_buff0~0=~z$w_buff0~0_In1744048728, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1744048728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1744048728, ~z$w_buff1~0=~z$w_buff1~0_In1744048728, ~z~0=~z~0_In1744048728} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1744048728, ~z$w_buff0~0=~z$w_buff0~0_In1744048728, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1744048728, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1744048728|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1744048728|, ~z$w_buff1~0=~z$w_buff1~0_In1744048728, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1744048728|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1744048728|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1744048728|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1744048728|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1744048728, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1744048728, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1744048728, ~z~0=~z~0_Out1744048728} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 23:02:09,196 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-21 23:02:09,197 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-10-21 23:02:09,199 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-21 23:02:09,199 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,200 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-21 23:02:09,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,200 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-21 23:02:09,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,200 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-21 23:02:09,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,201 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-21 23:02:09,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,201 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-21 23:02:09,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,202 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-21 23:02:09,202 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,202 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-21 23:02:09,202 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,202 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-21 23:02:09,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,203 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-21 23:02:09,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,204 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-21 23:02:09,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,204 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-21 23:02:09,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,204 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-21 23:02:09,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,205 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-21 23:02:09,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,205 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-21 23:02:09,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,205 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-21 23:02:09,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,206 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-21 23:02:09,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,206 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-21 23:02:09,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,207 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-21 23:02:09,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,207 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-21 23:02:09,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,207 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-21 23:02:09,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,208 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-21 23:02:09,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,208 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-21 23:02:09,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:09,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:02:09 BasicIcfg [2020-10-21 23:02:09,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:02:09,287 INFO L168 Benchmark]: Toolchain (without parser) took 19929.28 ms. Allocated memory was 146.3 MB in the beginning and 434.6 MB in the end (delta: 288.4 MB). Free memory was 100.4 MB in the beginning and 164.2 MB in the end (delta: -63.8 MB). Peak memory consumption was 224.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:09,289 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:02:09,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.84 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 99.5 MB in the beginning and 154.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:09,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.28 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:09,291 INFO L168 Benchmark]: Boogie Preprocessor took 40.07 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:09,292 INFO L168 Benchmark]: RCFGBuilder took 2037.81 ms. Allocated memory was 202.4 MB in the beginning and 250.6 MB in the end (delta: 48.2 MB). Free memory was 148.6 MB in the beginning and 179.7 MB in the end (delta: -31.1 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:09,298 INFO L168 Benchmark]: TraceAbstraction took 16911.77 ms. Allocated memory was 250.6 MB in the beginning and 434.6 MB in the end (delta: 184.0 MB). Free memory was 179.7 MB in the beginning and 164.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:09,303 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 853.84 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 99.5 MB in the beginning and 154.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.28 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.07 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2037.81 ms. Allocated memory was 202.4 MB in the beginning and 250.6 MB in the end (delta: 48.2 MB). Free memory was 148.6 MB in the beginning and 179.7 MB in the end (delta: -31.1 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16911.77 ms. Allocated memory was 250.6 MB in the beginning and 434.6 MB in the end (delta: 184.0 MB). Free memory was 179.7 MB in the beginning and 164.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 105 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.0s, 126 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 7247 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1525; [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.2s, HoareTripleCheckerStatistics: 551 SDtfs, 574 SDslu, 799 SDs, 0 SdLazy, 372 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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: 0.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 527 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 37060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...