/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:31:44,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:31:44,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:31:44,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:31:44,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:31:44,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:31:44,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:31:44,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:31:44,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:31:44,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:31:44,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:31:44,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:31:44,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:31:44,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:31:44,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:31:44,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:31:44,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:31:44,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:31:44,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:31:44,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:31:44,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:31:44,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:31:44,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:31:44,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:31:44,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:31:44,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:31:44,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:31:44,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:31:44,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:31:44,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:31:44,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:31:44,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:31:44,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:31:44,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:31:44,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:31:44,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:31:44,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:31:44,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:31:44,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:31:44,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:31:44,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:31:44,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:31:44,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:31:44,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:31:44,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:31:44,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:31:44,877 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:31:44,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:31:44,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:31:44,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:31:44,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:31:44,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:31:44,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:31:44,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:31:44,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:31:44,880 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:31:44,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:31:44,880 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:31:44,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:31:44,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:31:44,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:31:44,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:31:44,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:31:44,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:31:44,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:31:44,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:31:44,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:31:44,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:31:44,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:31:44,883 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:31:44,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:31:44,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:31:44,884 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:31:44,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:31:45,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:31:45,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:31:45,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:31:45,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:31:45,212 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:31:45,213 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-27 20:31:45,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e69d529f/bfbf2709fd014006ac8a7d42fe24f422/FLAG98afa825e [2019-12-27 20:31:45,854 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:31:45,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-27 20:31:45,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e69d529f/bfbf2709fd014006ac8a7d42fe24f422/FLAG98afa825e [2019-12-27 20:31:46,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e69d529f/bfbf2709fd014006ac8a7d42fe24f422 [2019-12-27 20:31:46,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:31:46,089 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:31:46,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:31:46,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:31:46,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:31:46,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:46,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547f068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46, skipping insertion in model container [2019-12-27 20:31:46,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:46,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:31:46,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:31:46,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:31:46,767 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:31:46,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:31:46,907 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:31:46,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46 WrapperNode [2019-12-27 20:31:46,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:31:46,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:31:46,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:31:46,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:31:46,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:46,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:46,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:31:46,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:31:46,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:31:46,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:31:46,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:46,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:46,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:46,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:47,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:47,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:47,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... [2019-12-27 20:31:47,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:31:47,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:31:47,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:31:47,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:31:47,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:31:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:31:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:31:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:31:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:31:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:31:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:31:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:31:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:31:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:31:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:31:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:31:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:31:47,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:31:47,083 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:31:47,860 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:31:47,860 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:31:47,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:31:47 BoogieIcfgContainer [2019-12-27 20:31:47,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:31:47,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:31:47,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:31:47,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:31:47,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:31:46" (1/3) ... [2019-12-27 20:31:47,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:31:47, skipping insertion in model container [2019-12-27 20:31:47,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:46" (2/3) ... [2019-12-27 20:31:47,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:31:47, skipping insertion in model container [2019-12-27 20:31:47,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:31:47" (3/3) ... [2019-12-27 20:31:47,869 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.opt.i [2019-12-27 20:31:47,879 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:31:47,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:31:47,887 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:31:47,888 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:31:47,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,002 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,003 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,023 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,030 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,030 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:31:48,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:31:48,066 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:31:48,067 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:31:48,067 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:31:48,067 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:31:48,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:31:48,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:31:48,067 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:31:48,068 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:31:48,086 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 20:31:48,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:31:48,208 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:31:48,209 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:31:48,228 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:31:48,250 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:31:48,334 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:31:48,334 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:31:48,342 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:31:48,361 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 20:31:48,362 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:31:52,164 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:31:52,309 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:31:52,333 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-27 20:31:52,333 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 20:31:52,337 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 20:32:02,892 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 20:32:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 20:32:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:32:02,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:02,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:32:02,901 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-27 20:32:02,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:02,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595744299] [2019-12-27 20:32:02,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:03,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595744299] [2019-12-27 20:32:03,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:03,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:32:03,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1550680633] [2019-12-27 20:32:03,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:03,214 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:03,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:32:03,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:03,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:03,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:03,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:03,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:03,249 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 20:32:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:06,196 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 20:32:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:06,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:32:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:06,674 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 20:32:06,674 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 20:32:06,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 20:32:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 20:32:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 20:32:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 20:32:13,553 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 20:32:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:13,554 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 20:32:13,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 20:32:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:32:13,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:13,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:13,563 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:13,564 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-27 20:32:13,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:13,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971117987] [2019-12-27 20:32:13,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:13,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971117987] [2019-12-27 20:32:13,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:13,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:13,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [680420904] [2019-12-27 20:32:13,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:13,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:13,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:32:13,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:13,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:13,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:13,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:13,670 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 20:32:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:16,522 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 20:32:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:16,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:32:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:16,606 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 20:32:16,606 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 20:32:16,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 20:32:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 20:32:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 20:32:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 20:32:17,072 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 20:32:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:17,072 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 20:32:17,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 20:32:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:32:17,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:17,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:17,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-27 20:32:17,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:17,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372147822] [2019-12-27 20:32:17,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:17,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372147822] [2019-12-27 20:32:17,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:17,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:17,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297969678] [2019-12-27 20:32:17,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:17,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:17,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:32:17,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:17,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:17,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:32:17,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:17,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:32:17,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:17,151 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 20:32:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:17,549 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 20:32:17,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:17,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:32:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:17,650 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 20:32:17,650 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 20:32:17,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 20:32:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 20:32:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 20:32:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 20:32:18,715 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 20:32:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:18,716 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 20:32:18,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:32:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 20:32:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:32:18,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:18,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:18,719 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-27 20:32:18,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:18,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112286800] [2019-12-27 20:32:18,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:18,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112286800] [2019-12-27 20:32:18,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:18,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:18,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [316703208] [2019-12-27 20:32:18,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:18,826 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:18,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:32:18,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:18,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:32:18,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:18,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:18,864 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 5 states. [2019-12-27 20:32:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:19,291 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 20:32:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:19,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:32:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:19,371 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 20:32:19,372 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 20:32:19,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:32:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 20:32:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 20:32:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 20:32:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 20:32:20,535 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 20:32:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:20,536 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 20:32:20,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 20:32:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:32:20,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:20,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:20,538 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-27 20:32:20,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:20,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499397095] [2019-12-27 20:32:20,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:20,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499397095] [2019-12-27 20:32:20,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:20,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:20,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [477575928] [2019-12-27 20:32:20,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:20,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:20,604 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:32:20,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:20,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:32:20,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:20,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:20,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:20,634 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 5 states. [2019-12-27 20:32:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:21,020 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 20:32:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:21,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:32:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:21,087 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 20:32:21,087 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 20:32:21,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:32:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 20:32:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 20:32:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 20:32:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 20:32:22,082 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 20:32:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:22,083 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 20:32:22,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 20:32:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:32:22,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:22,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:22,093 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-27 20:32:22,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:22,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253597271] [2019-12-27 20:32:22,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:22,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253597271] [2019-12-27 20:32:22,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:22,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:22,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765144844] [2019-12-27 20:32:22,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:22,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:22,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 20:32:22,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:22,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:22,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:22,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:22,251 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 20:32:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:22,845 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 20:32:22,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:32:22,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:32:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:22,927 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 20:32:22,927 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 20:32:22,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:32:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 20:32:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 20:32:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 20:32:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 20:32:23,953 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 20:32:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:23,954 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 20:32:23,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 20:32:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:32:23,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:23,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:23,964 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-27 20:32:23,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:23,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272497416] [2019-12-27 20:32:23,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:24,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272497416] [2019-12-27 20:32:24,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:24,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:24,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991302992] [2019-12-27 20:32:24,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:24,058 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:24,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 20:32:24,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:24,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:24,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:24,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:24,068 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 20:32:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:24,663 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 20:32:24,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:32:24,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:32:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:24,745 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 20:32:24,746 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 20:32:24,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:32:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 20:32:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 20:32:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 20:32:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 20:32:25,726 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 20:32:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:25,726 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 20:32:25,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 20:32:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:32:25,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:25,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:25,739 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-27 20:32:25,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:25,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526521710] [2019-12-27 20:32:25,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:25,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526521710] [2019-12-27 20:32:25,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:25,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:25,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653546751] [2019-12-27 20:32:25,813 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:25,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:25,825 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:32:25,825 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:25,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:25,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:32:25,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:25,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:32:25,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:25,827 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 20:32:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:25,893 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 20:32:25,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:32:25,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 20:32:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:25,910 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 20:32:25,910 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 20:32:25,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 20:32:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 20:32:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 20:32:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 20:32:26,077 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 20:32:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:26,077 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 20:32:26,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:32:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 20:32:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:32:26,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:26,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:26,092 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-27 20:32:26,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:26,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185199100] [2019-12-27 20:32:26,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:26,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185199100] [2019-12-27 20:32:26,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:26,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:32:26,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2143489564] [2019-12-27 20:32:26,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:26,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:26,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 100 transitions. [2019-12-27 20:32:26,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:26,192 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:26,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:26,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:26,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:26,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:26,193 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 20:32:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:26,234 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-27 20:32:26,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:26,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:32:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:26,251 INFO L225 Difference]: With dead ends: 11488 [2019-12-27 20:32:26,251 INFO L226 Difference]: Without dead ends: 11488 [2019-12-27 20:32:26,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-27 20:32:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-27 20:32:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-27 20:32:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-27 20:32:26,418 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-27 20:32:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:26,418 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-27 20:32:26,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-27 20:32:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:32:26,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:26,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:26,435 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-27 20:32:26,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:26,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871663967] [2019-12-27 20:32:26,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:26,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871663967] [2019-12-27 20:32:26,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:26,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:32:26,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [595980796] [2019-12-27 20:32:26,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:26,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:26,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 166 transitions. [2019-12-27 20:32:26,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:26,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:32:26,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:26,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:26,589 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-27 20:32:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:27,165 INFO L93 Difference]: Finished difference Result 17261 states and 52536 transitions. [2019-12-27 20:32:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:32:27,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 20:32:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:27,199 INFO L225 Difference]: With dead ends: 17261 [2019-12-27 20:32:27,199 INFO L226 Difference]: Without dead ends: 17261 [2019-12-27 20:32:27,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:32:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17261 states. [2019-12-27 20:32:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17261 to 15423. [2019-12-27 20:32:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15423 states. [2019-12-27 20:32:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15423 states to 15423 states and 47364 transitions. [2019-12-27 20:32:27,678 INFO L78 Accepts]: Start accepts. Automaton has 15423 states and 47364 transitions. Word has length 40 [2019-12-27 20:32:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:27,679 INFO L462 AbstractCegarLoop]: Abstraction has 15423 states and 47364 transitions. [2019-12-27 20:32:27,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 15423 states and 47364 transitions. [2019-12-27 20:32:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:32:27,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:27,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:27,712 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1253428480, now seen corresponding path program 2 times [2019-12-27 20:32:27,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:27,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619009752] [2019-12-27 20:32:27,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:27,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619009752] [2019-12-27 20:32:27,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:27,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:32:27,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [735339764] [2019-12-27 20:32:27,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:27,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:27,880 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 191 transitions. [2019-12-27 20:32:27,881 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:27,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:32:27,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:32:27,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:32:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:32:27,940 INFO L87 Difference]: Start difference. First operand 15423 states and 47364 transitions. Second operand 8 states. [2019-12-27 20:32:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:29,829 INFO L93 Difference]: Finished difference Result 47193 states and 142406 transitions. [2019-12-27 20:32:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:32:29,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 20:32:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:29,901 INFO L225 Difference]: With dead ends: 47193 [2019-12-27 20:32:29,901 INFO L226 Difference]: Without dead ends: 47193 [2019-12-27 20:32:29,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:32:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47193 states. [2019-12-27 20:32:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47193 to 17298. [2019-12-27 20:32:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17298 states. [2019-12-27 20:32:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17298 states to 17298 states and 53343 transitions. [2019-12-27 20:32:30,578 INFO L78 Accepts]: Start accepts. Automaton has 17298 states and 53343 transitions. Word has length 40 [2019-12-27 20:32:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:30,578 INFO L462 AbstractCegarLoop]: Abstraction has 17298 states and 53343 transitions. [2019-12-27 20:32:30,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:32:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 17298 states and 53343 transitions. [2019-12-27 20:32:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:32:30,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:30,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:30,604 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1511982952, now seen corresponding path program 3 times [2019-12-27 20:32:30,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:30,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713371536] [2019-12-27 20:32:30,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:30,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713371536] [2019-12-27 20:32:30,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:30,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:32:30,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439081844] [2019-12-27 20:32:30,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:30,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:30,719 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 173 transitions. [2019-12-27 20:32:30,719 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:30,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:32:30,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:30,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:30,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:30,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:30,732 INFO L87 Difference]: Start difference. First operand 17298 states and 53343 transitions. Second operand 5 states. [2019-12-27 20:32:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:30,853 INFO L93 Difference]: Finished difference Result 15961 states and 49882 transitions. [2019-12-27 20:32:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:30,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 20:32:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:30,894 INFO L225 Difference]: With dead ends: 15961 [2019-12-27 20:32:30,894 INFO L226 Difference]: Without dead ends: 15961 [2019-12-27 20:32:30,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15961 states. [2019-12-27 20:32:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15961 to 15082. [2019-12-27 20:32:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15082 states. [2019-12-27 20:32:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15082 states to 15082 states and 47414 transitions. [2019-12-27 20:32:31,295 INFO L78 Accepts]: Start accepts. Automaton has 15082 states and 47414 transitions. Word has length 40 [2019-12-27 20:32:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:31,295 INFO L462 AbstractCegarLoop]: Abstraction has 15082 states and 47414 transitions. [2019-12-27 20:32:31,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 15082 states and 47414 transitions. [2019-12-27 20:32:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:31,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:31,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:31,325 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-27 20:32:31,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:31,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103255236] [2019-12-27 20:32:31,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:31,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103255236] [2019-12-27 20:32:31,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:31,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:31,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328300902] [2019-12-27 20:32:31,381 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:31,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:31,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 20:32:31,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:31,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:32:31,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:31,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:31,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:31,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:31,539 INFO L87 Difference]: Start difference. First operand 15082 states and 47414 transitions. Second operand 3 states. [2019-12-27 20:32:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:31,620 INFO L93 Difference]: Finished difference Result 18848 states and 58458 transitions. [2019-12-27 20:32:31,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:31,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:32:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:31,646 INFO L225 Difference]: With dead ends: 18848 [2019-12-27 20:32:31,646 INFO L226 Difference]: Without dead ends: 18848 [2019-12-27 20:32:31,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18848 states. [2019-12-27 20:32:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18848 to 15871. [2019-12-27 20:32:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15871 states. [2019-12-27 20:32:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15871 states to 15871 states and 49745 transitions. [2019-12-27 20:32:32,113 INFO L78 Accepts]: Start accepts. Automaton has 15871 states and 49745 transitions. Word has length 54 [2019-12-27 20:32:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:32,114 INFO L462 AbstractCegarLoop]: Abstraction has 15871 states and 49745 transitions. [2019-12-27 20:32:32,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 15871 states and 49745 transitions. [2019-12-27 20:32:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:32,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:32,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:32,131 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:32,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-27 20:32:32,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:32,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010589112] [2019-12-27 20:32:32,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:32,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010589112] [2019-12-27 20:32:32,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:32,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:32:32,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575939658] [2019-12-27 20:32:32,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:32,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:32,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 20:32:32,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:32,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:32:32,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:32:32,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:32,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:32:32,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:32:32,512 INFO L87 Difference]: Start difference. First operand 15871 states and 49745 transitions. Second operand 8 states. [2019-12-27 20:32:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:34,042 INFO L93 Difference]: Finished difference Result 55718 states and 171367 transitions. [2019-12-27 20:32:34,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:32:34,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 20:32:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:34,109 INFO L225 Difference]: With dead ends: 55718 [2019-12-27 20:32:34,109 INFO L226 Difference]: Without dead ends: 43030 [2019-12-27 20:32:34,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:32:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43030 states. [2019-12-27 20:32:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43030 to 19493. [2019-12-27 20:32:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19493 states. [2019-12-27 20:32:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19493 states to 19493 states and 61279 transitions. [2019-12-27 20:32:34,618 INFO L78 Accepts]: Start accepts. Automaton has 19493 states and 61279 transitions. Word has length 54 [2019-12-27 20:32:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:34,618 INFO L462 AbstractCegarLoop]: Abstraction has 19493 states and 61279 transitions. [2019-12-27 20:32:34,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:32:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19493 states and 61279 transitions. [2019-12-27 20:32:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:34,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:34,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:34,649 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-27 20:32:34,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:34,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763559517] [2019-12-27 20:32:34,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:34,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763559517] [2019-12-27 20:32:34,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:34,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:32:34,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803987543] [2019-12-27 20:32:34,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:34,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:35,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 333 transitions. [2019-12-27 20:32:35,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:35,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:32:35,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:32:35,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:32:35,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:32:35,098 INFO L87 Difference]: Start difference. First operand 19493 states and 61279 transitions. Second operand 7 states. [2019-12-27 20:32:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:35,511 INFO L93 Difference]: Finished difference Result 46267 states and 142621 transitions. [2019-12-27 20:32:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:32:35,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 20:32:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:35,564 INFO L225 Difference]: With dead ends: 46267 [2019-12-27 20:32:35,564 INFO L226 Difference]: Without dead ends: 34204 [2019-12-27 20:32:35,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:32:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34204 states. [2019-12-27 20:32:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34204 to 23387. [2019-12-27 20:32:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23387 states. [2019-12-27 20:32:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23387 states to 23387 states and 73224 transitions. [2019-12-27 20:32:36,040 INFO L78 Accepts]: Start accepts. Automaton has 23387 states and 73224 transitions. Word has length 54 [2019-12-27 20:32:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:36,040 INFO L462 AbstractCegarLoop]: Abstraction has 23387 states and 73224 transitions. [2019-12-27 20:32:36,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:32:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 23387 states and 73224 transitions. [2019-12-27 20:32:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:36,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:36,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:36,079 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash -229272590, now seen corresponding path program 3 times [2019-12-27 20:32:36,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:36,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084834622] [2019-12-27 20:32:36,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:36,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084834622] [2019-12-27 20:32:36,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:36,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:32:36,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365030357] [2019-12-27 20:32:36,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:36,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:36,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 236 transitions. [2019-12-27 20:32:36,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:36,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:32:36,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:32:36,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:36,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:32:36,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:32:36,645 INFO L87 Difference]: Start difference. First operand 23387 states and 73224 transitions. Second operand 9 states. [2019-12-27 20:32:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:38,445 INFO L93 Difference]: Finished difference Result 123725 states and 381575 transitions. [2019-12-27 20:32:38,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 20:32:38,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 20:32:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:38,618 INFO L225 Difference]: With dead ends: 123725 [2019-12-27 20:32:38,618 INFO L226 Difference]: Without dead ends: 106750 [2019-12-27 20:32:38,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 20:32:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106750 states. [2019-12-27 20:32:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106750 to 32187. [2019-12-27 20:32:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32187 states. [2019-12-27 20:32:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32187 states to 32187 states and 101736 transitions. [2019-12-27 20:32:40,088 INFO L78 Accepts]: Start accepts. Automaton has 32187 states and 101736 transitions. Word has length 54 [2019-12-27 20:32:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:40,089 INFO L462 AbstractCegarLoop]: Abstraction has 32187 states and 101736 transitions. [2019-12-27 20:32:40,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:32:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32187 states and 101736 transitions. [2019-12-27 20:32:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:40,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:40,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:40,130 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1063097586, now seen corresponding path program 4 times [2019-12-27 20:32:40,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:40,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297929383] [2019-12-27 20:32:40,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:40,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297929383] [2019-12-27 20:32:40,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:40,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:32:40,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634160161] [2019-12-27 20:32:40,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:40,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:40,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 298 transitions. [2019-12-27 20:32:40,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:40,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 20:32:40,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:32:40,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:32:40,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:32:40,590 INFO L87 Difference]: Start difference. First operand 32187 states and 101736 transitions. Second operand 10 states. [2019-12-27 20:32:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:42,891 INFO L93 Difference]: Finished difference Result 108400 states and 333040 transitions. [2019-12-27 20:32:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 20:32:42,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 20:32:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:43,057 INFO L225 Difference]: With dead ends: 108400 [2019-12-27 20:32:43,057 INFO L226 Difference]: Without dead ends: 103625 [2019-12-27 20:32:43,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=1709, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 20:32:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103625 states. [2019-12-27 20:32:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103625 to 31627. [2019-12-27 20:32:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31627 states. [2019-12-27 20:32:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31627 states to 31627 states and 100001 transitions. [2019-12-27 20:32:44,520 INFO L78 Accepts]: Start accepts. Automaton has 31627 states and 100001 transitions. Word has length 54 [2019-12-27 20:32:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:44,520 INFO L462 AbstractCegarLoop]: Abstraction has 31627 states and 100001 transitions. [2019-12-27 20:32:44,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:32:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 31627 states and 100001 transitions. [2019-12-27 20:32:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:44,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:44,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:44,568 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-27 20:32:44,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:44,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896025094] [2019-12-27 20:32:44,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:44,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896025094] [2019-12-27 20:32:44,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:44,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:32:44,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [576528699] [2019-12-27 20:32:44,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:44,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:44,864 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 284 transitions. [2019-12-27 20:32:44,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:44,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:32:44,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:32:45,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:32:45,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:32:45,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:45,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:32:45,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:32:45,079 INFO L87 Difference]: Start difference. First operand 31627 states and 100001 transitions. Second operand 14 states. [2019-12-27 20:32:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:49,472 INFO L93 Difference]: Finished difference Result 60648 states and 181712 transitions. [2019-12-27 20:32:49,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 20:32:49,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 20:32:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:49,564 INFO L225 Difference]: With dead ends: 60648 [2019-12-27 20:32:49,564 INFO L226 Difference]: Without dead ends: 60475 [2019-12-27 20:32:49,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=466, Invalid=1886, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 20:32:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60475 states. [2019-12-27 20:32:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60475 to 30583. [2019-12-27 20:32:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30583 states. [2019-12-27 20:32:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30583 states to 30583 states and 95474 transitions. [2019-12-27 20:32:50,328 INFO L78 Accepts]: Start accepts. Automaton has 30583 states and 95474 transitions. Word has length 54 [2019-12-27 20:32:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:50,329 INFO L462 AbstractCegarLoop]: Abstraction has 30583 states and 95474 transitions. [2019-12-27 20:32:50,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:32:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 30583 states and 95474 transitions. [2019-12-27 20:32:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:50,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:50,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:50,540 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash -623567340, now seen corresponding path program 6 times [2019-12-27 20:32:50,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:50,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309249731] [2019-12-27 20:32:50,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:50,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309249731] [2019-12-27 20:32:50,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:50,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:32:50,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024615037] [2019-12-27 20:32:50,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:50,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:50,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 303 transitions. [2019-12-27 20:32:50,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:50,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:32:50,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:32:50,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:50,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:32:50,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:32:50,938 INFO L87 Difference]: Start difference. First operand 30583 states and 95474 transitions. Second operand 10 states. [2019-12-27 20:32:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:53,257 INFO L93 Difference]: Finished difference Result 74524 states and 225224 transitions. [2019-12-27 20:32:53,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 20:32:53,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 20:32:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:53,370 INFO L225 Difference]: With dead ends: 74524 [2019-12-27 20:32:53,371 INFO L226 Difference]: Without dead ends: 74344 [2019-12-27 20:32:53,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:32:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74344 states. [2019-12-27 20:32:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74344 to 32777. [2019-12-27 20:32:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32777 states. [2019-12-27 20:32:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32777 states to 32777 states and 102585 transitions. [2019-12-27 20:32:54,585 INFO L78 Accepts]: Start accepts. Automaton has 32777 states and 102585 transitions. Word has length 54 [2019-12-27 20:32:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:54,585 INFO L462 AbstractCegarLoop]: Abstraction has 32777 states and 102585 transitions. [2019-12-27 20:32:54,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:32:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 32777 states and 102585 transitions. [2019-12-27 20:32:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:32:54,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:54,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:54,621 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:54,622 INFO L82 PathProgramCache]: Analyzing trace with hash -365012868, now seen corresponding path program 7 times [2019-12-27 20:32:54,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:54,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918779818] [2019-12-27 20:32:54,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:54,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918779818] [2019-12-27 20:32:54,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:54,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:54,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505276457] [2019-12-27 20:32:54,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:54,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:54,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 267 transitions. [2019-12-27 20:32:54,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:54,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:54,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:54,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:54,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:54,854 INFO L87 Difference]: Start difference. First operand 32777 states and 102585 transitions. Second operand 3 states. [2019-12-27 20:32:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:54,954 INFO L93 Difference]: Finished difference Result 32775 states and 102580 transitions. [2019-12-27 20:32:54,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:54,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:32:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:55,004 INFO L225 Difference]: With dead ends: 32775 [2019-12-27 20:32:55,004 INFO L226 Difference]: Without dead ends: 32775 [2019-12-27 20:32:55,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2019-12-27 20:32:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 27990. [2019-12-27 20:32:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27990 states. [2019-12-27 20:32:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27990 states to 27990 states and 88458 transitions. [2019-12-27 20:32:55,481 INFO L78 Accepts]: Start accepts. Automaton has 27990 states and 88458 transitions. Word has length 54 [2019-12-27 20:32:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:55,484 INFO L462 AbstractCegarLoop]: Abstraction has 27990 states and 88458 transitions. [2019-12-27 20:32:55,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27990 states and 88458 transitions. [2019-12-27 20:32:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:32:55,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:55,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:55,521 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-27 20:32:55,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:55,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218460940] [2019-12-27 20:32:55,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:55,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218460940] [2019-12-27 20:32:55,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:55,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:55,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [139726816] [2019-12-27 20:32:55,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:55,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:55,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 285 transitions. [2019-12-27 20:32:55,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:55,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:32:55,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:32:55,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:32:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:55,748 INFO L87 Difference]: Start difference. First operand 27990 states and 88458 transitions. Second operand 4 states. [2019-12-27 20:32:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:55,997 INFO L93 Difference]: Finished difference Result 29319 states and 90447 transitions. [2019-12-27 20:32:55,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:55,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 20:32:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:56,276 INFO L225 Difference]: With dead ends: 29319 [2019-12-27 20:32:56,276 INFO L226 Difference]: Without dead ends: 28635 [2019-12-27 20:32:56,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28635 states. [2019-12-27 20:32:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28635 to 20843. [2019-12-27 20:32:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20843 states. [2019-12-27 20:32:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20843 states to 20843 states and 65059 transitions. [2019-12-27 20:32:56,623 INFO L78 Accepts]: Start accepts. Automaton has 20843 states and 65059 transitions. Word has length 55 [2019-12-27 20:32:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:56,623 INFO L462 AbstractCegarLoop]: Abstraction has 20843 states and 65059 transitions. [2019-12-27 20:32:56,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:32:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 20843 states and 65059 transitions. [2019-12-27 20:32:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:32:56,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:56,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:56,647 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-27 20:32:56,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:56,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066763170] [2019-12-27 20:32:56,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:56,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066763170] [2019-12-27 20:32:56,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:56,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:32:56,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [731685213] [2019-12-27 20:32:56,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:56,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:56,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 281 transitions. [2019-12-27 20:32:56,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:56,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:32:56,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:32:56,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:32:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:32:56,945 INFO L87 Difference]: Start difference. First operand 20843 states and 65059 transitions. Second operand 9 states. [2019-12-27 20:32:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:58,161 INFO L93 Difference]: Finished difference Result 33371 states and 103206 transitions. [2019-12-27 20:32:58,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:32:58,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 20:32:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:58,202 INFO L225 Difference]: With dead ends: 33371 [2019-12-27 20:32:58,203 INFO L226 Difference]: Without dead ends: 27267 [2019-12-27 20:32:58,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:32:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27267 states. [2019-12-27 20:32:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27267 to 21494. [2019-12-27 20:32:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21494 states. [2019-12-27 20:32:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21494 states to 21494 states and 66705 transitions. [2019-12-27 20:32:58,568 INFO L78 Accepts]: Start accepts. Automaton has 21494 states and 66705 transitions. Word has length 56 [2019-12-27 20:32:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:58,568 INFO L462 AbstractCegarLoop]: Abstraction has 21494 states and 66705 transitions. [2019-12-27 20:32:58,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:32:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21494 states and 66705 transitions. [2019-12-27 20:32:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:32:58,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:58,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:58,591 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-27 20:32:58,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:58,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99191549] [2019-12-27 20:32:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:58,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99191549] [2019-12-27 20:32:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:58,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:32:58,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017196598] [2019-12-27 20:32:58,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:58,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:59,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 454 transitions. [2019-12-27 20:32:59,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:59,454 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:32:59,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:32:59,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:32:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:32:59,456 INFO L87 Difference]: Start difference. First operand 21494 states and 66705 transitions. Second operand 14 states. [2019-12-27 20:33:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:02,624 INFO L93 Difference]: Finished difference Result 31381 states and 95944 transitions. [2019-12-27 20:33:02,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 20:33:02,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 20:33:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:02,666 INFO L225 Difference]: With dead ends: 31381 [2019-12-27 20:33:02,666 INFO L226 Difference]: Without dead ends: 29091 [2019-12-27 20:33:02,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 20:33:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29091 states. [2019-12-27 20:33:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29091 to 21981. [2019-12-27 20:33:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-27 20:33:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67954 transitions. [2019-12-27 20:33:03,036 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67954 transitions. Word has length 56 [2019-12-27 20:33:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:03,037 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67954 transitions. [2019-12-27 20:33:03,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:33:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67954 transitions. [2019-12-27 20:33:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:03,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:03,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:03,059 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1830147234, now seen corresponding path program 3 times [2019-12-27 20:33:03,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:03,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944926674] [2019-12-27 20:33:03,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:03,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944926674] [2019-12-27 20:33:03,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:03,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 20:33:03,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447802657] [2019-12-27 20:33:03,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:03,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:03,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 357 transitions. [2019-12-27 20:33:03,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:03,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:33:03,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:33:03,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:03,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:33:03,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:33:03,929 INFO L87 Difference]: Start difference. First operand 21981 states and 67954 transitions. Second operand 18 states. [2019-12-27 20:33:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:11,695 INFO L93 Difference]: Finished difference Result 54211 states and 164602 transitions. [2019-12-27 20:33:11,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-27 20:33:11,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 20:33:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:11,761 INFO L225 Difference]: With dead ends: 54211 [2019-12-27 20:33:11,761 INFO L226 Difference]: Without dead ends: 43362 [2019-12-27 20:33:11,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3745 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1514, Invalid=9406, Unknown=0, NotChecked=0, Total=10920 [2019-12-27 20:33:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43362 states. [2019-12-27 20:33:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43362 to 21150. [2019-12-27 20:33:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21150 states. [2019-12-27 20:33:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21150 states to 21150 states and 65008 transitions. [2019-12-27 20:33:12,253 INFO L78 Accepts]: Start accepts. Automaton has 21150 states and 65008 transitions. Word has length 56 [2019-12-27 20:33:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 21150 states and 65008 transitions. [2019-12-27 20:33:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:33:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 21150 states and 65008 transitions. [2019-12-27 20:33:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:12,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:12,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:12,278 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash 943954388, now seen corresponding path program 4 times [2019-12-27 20:33:12,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:12,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038720110] [2019-12-27 20:33:12,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:13,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038720110] [2019-12-27 20:33:13,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:13,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:33:13,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379425160] [2019-12-27 20:33:13,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:13,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:13,237 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 361 transitions. [2019-12-27 20:33:13,237 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:13,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 20:33:13,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:33:13,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:33:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:33:13,516 INFO L87 Difference]: Start difference. First operand 21150 states and 65008 transitions. Second operand 18 states. [2019-12-27 20:33:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:18,304 INFO L93 Difference]: Finished difference Result 35303 states and 106957 transitions. [2019-12-27 20:33:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 20:33:18,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 20:33:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:18,352 INFO L225 Difference]: With dead ends: 35303 [2019-12-27 20:33:18,352 INFO L226 Difference]: Without dead ends: 34585 [2019-12-27 20:33:18,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 14 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=560, Invalid=2862, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 20:33:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34585 states. [2019-12-27 20:33:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34585 to 21390. [2019-12-27 20:33:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21390 states. [2019-12-27 20:33:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21390 states to 21390 states and 65670 transitions. [2019-12-27 20:33:18,749 INFO L78 Accepts]: Start accepts. Automaton has 21390 states and 65670 transitions. Word has length 56 [2019-12-27 20:33:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:18,749 INFO L462 AbstractCegarLoop]: Abstraction has 21390 states and 65670 transitions. [2019-12-27 20:33:18,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:33:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 21390 states and 65670 transitions. [2019-12-27 20:33:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:18,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:18,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:18,774 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 230149148, now seen corresponding path program 5 times [2019-12-27 20:33:18,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:18,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542520776] [2019-12-27 20:33:18,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:19,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542520776] [2019-12-27 20:33:19,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:19,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:33:19,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696959592] [2019-12-27 20:33:19,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:19,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:19,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 305 transitions. [2019-12-27 20:33:19,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:19,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 20:33:19,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:33:19,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:19,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:33:19,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:33:19,858 INFO L87 Difference]: Start difference. First operand 21390 states and 65670 transitions. Second operand 20 states. [2019-12-27 20:33:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:29,835 INFO L93 Difference]: Finished difference Result 50635 states and 153154 transitions. [2019-12-27 20:33:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-27 20:33:29,836 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 20:33:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:29,903 INFO L225 Difference]: With dead ends: 50635 [2019-12-27 20:33:29,904 INFO L226 Difference]: Without dead ends: 47621 [2019-12-27 20:33:29,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 15 SyntacticMatches, 16 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4354 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1581, Invalid=10191, Unknown=0, NotChecked=0, Total=11772 [2019-12-27 20:33:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47621 states. [2019-12-27 20:33:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47621 to 21625. [2019-12-27 20:33:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21625 states. [2019-12-27 20:33:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21625 states to 21625 states and 66491 transitions. [2019-12-27 20:33:30,411 INFO L78 Accepts]: Start accepts. Automaton has 21625 states and 66491 transitions. Word has length 56 [2019-12-27 20:33:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:30,411 INFO L462 AbstractCegarLoop]: Abstraction has 21625 states and 66491 transitions. [2019-12-27 20:33:30,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:33:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 21625 states and 66491 transitions. [2019-12-27 20:33:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:30,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:30,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:30,434 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:30,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2135959138, now seen corresponding path program 6 times [2019-12-27 20:33:30,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:30,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30104210] [2019-12-27 20:33:30,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:30,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30104210] [2019-12-27 20:33:30,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:30,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 20:33:30,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [399660325] [2019-12-27 20:33:30,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:30,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:31,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 250 transitions. [2019-12-27 20:33:31,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:31,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:33:31,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:33:31,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:33:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:33:31,293 INFO L87 Difference]: Start difference. First operand 21625 states and 66491 transitions. Second operand 17 states. [2019-12-27 20:33:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:42,831 INFO L93 Difference]: Finished difference Result 67852 states and 205551 transitions. [2019-12-27 20:33:42,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-12-27 20:33:42,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 20:33:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:42,921 INFO L225 Difference]: With dead ends: 67852 [2019-12-27 20:33:42,921 INFO L226 Difference]: Without dead ends: 54186 [2019-12-27 20:33:42,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6672 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2174, Invalid=15648, Unknown=0, NotChecked=0, Total=17822 [2019-12-27 20:33:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-12-27 20:33:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 22339. [2019-12-27 20:33:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22339 states. [2019-12-27 20:33:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22339 states to 22339 states and 68963 transitions. [2019-12-27 20:33:43,496 INFO L78 Accepts]: Start accepts. Automaton has 22339 states and 68963 transitions. Word has length 56 [2019-12-27 20:33:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:43,496 INFO L462 AbstractCegarLoop]: Abstraction has 22339 states and 68963 transitions. [2019-12-27 20:33:43,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:33:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 22339 states and 68963 transitions. [2019-12-27 20:33:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:43,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:43,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:43,520 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -301888144, now seen corresponding path program 7 times [2019-12-27 20:33:43,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:43,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675571168] [2019-12-27 20:33:43,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:43,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675571168] [2019-12-27 20:33:43,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:43,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:33:43,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164899496] [2019-12-27 20:33:43,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:43,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:43,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 288 transitions. [2019-12-27 20:33:43,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:44,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:33:44,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:33:44,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:33:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:33:44,068 INFO L87 Difference]: Start difference. First operand 22339 states and 68963 transitions. Second operand 14 states. [2019-12-27 20:33:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:46,929 INFO L93 Difference]: Finished difference Result 43683 states and 134209 transitions. [2019-12-27 20:33:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 20:33:46,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 20:33:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:46,992 INFO L225 Difference]: With dead ends: 43683 [2019-12-27 20:33:46,993 INFO L226 Difference]: Without dead ends: 38677 [2019-12-27 20:33:46,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=376, Invalid=1880, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 20:33:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38677 states. [2019-12-27 20:33:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38677 to 20469. [2019-12-27 20:33:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20469 states. [2019-12-27 20:33:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20469 states to 20469 states and 63435 transitions. [2019-12-27 20:33:47,461 INFO L78 Accepts]: Start accepts. Automaton has 20469 states and 63435 transitions. Word has length 56 [2019-12-27 20:33:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:47,461 INFO L462 AbstractCegarLoop]: Abstraction has 20469 states and 63435 transitions. [2019-12-27 20:33:47,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:33:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 20469 states and 63435 transitions. [2019-12-27 20:33:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:47,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:47,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:47,484 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 8 times [2019-12-27 20:33:47,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:47,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706797022] [2019-12-27 20:33:47,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:33:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:33:47,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:33:47,610 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:33:47,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_16|) |v_ULTIMATE.start_main_~#t642~0.offset_13| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t642~0.base_16|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_ULTIMATE.start_main_~#t642~0.offset_13| 0) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t642~0.base_16| 1)) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t642~0.base_16| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t642~0.base_16|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t642~0.offset=|v_ULTIMATE.start_main_~#t642~0.offset_13|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_19|, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t642~0.base=|v_ULTIMATE.start_main_~#t642~0.base_16|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_15|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t642~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t644~0.base, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t644~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t642~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:33:47,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t643~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t643~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t643~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11|) |v_ULTIMATE.start_main_~#t643~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t643~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_10|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:33:47,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= 1 ~y$w_buff0~0_Out-1795219914) (= (mod ~y$w_buff1_used~0_Out-1795219914 256) 0) (= ~y$w_buff0_used~0_Out-1795219914 1) (= ~y$w_buff0~0_In-1795219914 ~y$w_buff1~0_Out-1795219914) (= |P1Thread1of1ForFork1_#in~arg.base_In-1795219914| P1Thread1of1ForFork1_~arg.base_Out-1795219914) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1795219914| 1) (= ~y$w_buff1_used~0_Out-1795219914 ~y$w_buff0_used~0_In-1795219914) (= |P1Thread1of1ForFork1_#in~arg.offset_In-1795219914| P1Thread1of1ForFork1_~arg.offset_Out-1795219914) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1795219914 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1795219914|)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1795219914, ~y$w_buff0~0=~y$w_buff0~0_In-1795219914, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1795219914|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1795219914|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1795219914, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1795219914, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1795219914, ~y$w_buff1~0=~y$w_buff1~0_Out-1795219914, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1795219914|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1795219914, ~y$w_buff0~0=~y$w_buff0~0_Out-1795219914, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1795219914|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1795219914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1795219914} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:33:47,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11|) |v_ULTIMATE.start_main_~#t644~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t644~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t644~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t644~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t644~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t644~0.base, ULTIMATE.start_main_~#t644~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:33:47,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1310484933 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1310484933 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite33_Out1310484933| |P2Thread1of1ForFork2_#t~ite32_Out1310484933|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1310484933 |P2Thread1of1ForFork2_#t~ite32_Out1310484933|) .cse2) (and (or .cse0 .cse1) (= ~y~0_In1310484933 |P2Thread1of1ForFork2_#t~ite32_Out1310484933|) .cse2))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1310484933, ~y$w_buff1~0=~y$w_buff1~0_In1310484933, ~y~0=~y~0_In1310484933, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1310484933} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1310484933, ~y$w_buff1~0=~y$w_buff1~0_In1310484933, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1310484933|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out1310484933|, ~y~0=~y~0_In1310484933, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1310484933} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 20:33:47,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In284717235 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In284717235 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out284717235| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out284717235| ~y$w_buff0_used~0_In284717235) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In284717235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In284717235} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In284717235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In284717235, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out284717235|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:33:47,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-512631790 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-512631790 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-512631790| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-512631790| ~y$w_buff0_used~0_In-512631790)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-512631790, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-512631790} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-512631790|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-512631790, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-512631790} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 20:33:47,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1280836038 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1280836038 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1280836038 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1280836038 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out-1280836038|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1280836038 |P2Thread1of1ForFork2_#t~ite35_Out-1280836038|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1280836038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1280836038, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1280836038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1280836038} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-1280836038|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1280836038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1280836038, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1280836038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1280836038} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 20:33:47,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1302758082 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1302758082 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1302758082 |P2Thread1of1ForFork2_#t~ite36_Out-1302758082|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-1302758082|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1302758082, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1302758082} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1302758082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1302758082, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1302758082} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 20:33:47,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-796928449 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-796928449 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-796928449 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-796928449 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-796928449|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite37_Out-796928449| ~y$r_buff1_thd3~0_In-796928449)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-796928449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-796928449, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-796928449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-796928449} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-796928449|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-796928449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-796928449, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-796928449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-796928449} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 20:33:47,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:33:47,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1851772350 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1851772350 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1851772350 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1851772350 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out1851772350| ~y$w_buff1_used~0_In1851772350) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite29_Out1851772350| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851772350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851772350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851772350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851772350} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851772350, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1851772350|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851772350, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851772350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851772350} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 20:33:47,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In309690555 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In309690555 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In309690555 ~y$r_buff0_thd2~0_Out309690555)) (and (= 0 ~y$r_buff0_thd2~0_Out309690555) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In309690555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In309690555} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out309690555|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In309690555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out309690555} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:33:47,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1698973184 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1698973184 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1698973184 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1698973184 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1698973184 |P1Thread1of1ForFork1_#t~ite31_Out-1698973184|)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1698973184| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1698973184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698973184, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1698973184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698973184} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1698973184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698973184, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1698973184|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1698973184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698973184} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:33:47,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:33:47,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In223494833 256)))) (or (and (= ~y$w_buff0~0_In223494833 |P0Thread1of1ForFork0_#t~ite9_Out223494833|) (= |P0Thread1of1ForFork0_#t~ite8_In223494833| |P0Thread1of1ForFork0_#t~ite8_Out223494833|) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out223494833| ~y$w_buff0~0_In223494833) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In223494833 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In223494833 256))) (and (= 0 (mod ~y$w_buff1_used~0_In223494833 256)) .cse1) (= (mod ~y$w_buff0_used~0_In223494833 256) 0))) .cse0 (= |P0Thread1of1ForFork0_#t~ite8_Out223494833| |P0Thread1of1ForFork0_#t~ite9_Out223494833|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In223494833, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223494833, ~y$w_buff0~0=~y$w_buff0~0_In223494833, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In223494833, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In223494833|, ~weak$$choice2~0=~weak$$choice2~0_In223494833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223494833} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In223494833, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out223494833|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223494833, ~y$w_buff0~0=~y$w_buff0~0_In223494833, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out223494833|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In223494833, ~weak$$choice2~0=~weak$$choice2~0_In223494833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223494833} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:33:47,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-826674271 256)))) (or (and (= ~y$w_buff1~0_In-826674271 |P0Thread1of1ForFork0_#t~ite12_Out-826674271|) (= |P0Thread1of1ForFork0_#t~ite11_In-826674271| |P0Thread1of1ForFork0_#t~ite11_Out-826674271|) (not .cse0)) (and (= ~y$w_buff1~0_In-826674271 |P0Thread1of1ForFork0_#t~ite11_Out-826674271|) (= |P0Thread1of1ForFork0_#t~ite11_Out-826674271| |P0Thread1of1ForFork0_#t~ite12_Out-826674271|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-826674271 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-826674271 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-826674271 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-826674271 256)))))))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-826674271|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-826674271, ~y$w_buff1~0=~y$w_buff1~0_In-826674271, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-826674271, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-826674271, ~weak$$choice2~0=~weak$$choice2~0_In-826674271, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-826674271} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-826674271|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-826674271, ~y$w_buff1~0=~y$w_buff1~0_In-826674271, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-826674271, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-826674271, ~weak$$choice2~0=~weak$$choice2~0_In-826674271, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-826674271|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-826674271} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 20:33:47,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 20:33:47,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-2145173214 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-2145173214 256))) (.cse1 (= |P0Thread1of1ForFork0_#t~ite24_Out-2145173214| |P0Thread1of1ForFork0_#t~ite23_Out-2145173214|)) (.cse5 (= 0 (mod ~y$w_buff1_used~0_In-2145173214 256))) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-2145173214 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-2145173214 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite22_In-2145173214| |P0Thread1of1ForFork0_#t~ite22_Out-2145173214|) (or (and .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse3 .cse5)) (= ~y$r_buff1_thd1~0_In-2145173214 |P0Thread1of1ForFork0_#t~ite23_Out-2145173214|)) (and (not .cse0) (= ~y$r_buff1_thd1~0_In-2145173214 |P0Thread1of1ForFork0_#t~ite24_Out-2145173214|) (= |P0Thread1of1ForFork0_#t~ite23_In-2145173214| |P0Thread1of1ForFork0_#t~ite23_Out-2145173214|)))) (let ((.cse6 (not .cse3))) (and (= 0 |P0Thread1of1ForFork0_#t~ite22_Out-2145173214|) (or .cse6 (not .cse2)) (= |P0Thread1of1ForFork0_#t~ite23_Out-2145173214| |P0Thread1of1ForFork0_#t~ite22_Out-2145173214|) .cse0 .cse1 (or (not .cse5) .cse6) (not .cse4))))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In-2145173214|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2145173214, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145173214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2145173214, ~weak$$choice2~0=~weak$$choice2~0_In-2145173214, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145173214, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-2145173214|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out-2145173214|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2145173214, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145173214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2145173214, ~weak$$choice2~0=~weak$$choice2~0_In-2145173214, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-2145173214|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-2145173214|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145173214} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 20:33:47,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 20:33:47,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:33:47,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In563356853 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In563356853 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out563356853| ~y$w_buff1~0_In563356853) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out563356853| ~y~0_In563356853) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In563356853, ~y~0=~y~0_In563356853, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In563356853, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563356853} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out563356853|, ~y$w_buff1~0=~y$w_buff1~0_In563356853, ~y~0=~y~0_In563356853, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In563356853, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563356853} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 20:33:47,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:33:47,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1710617547 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1710617547 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1710617547|)) (and (= ~y$w_buff0_used~0_In1710617547 |ULTIMATE.start_main_#t~ite43_Out1710617547|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1710617547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1710617547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1710617547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1710617547, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1710617547|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:33:47,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1716863663 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1716863663 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1716863663 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1716863663 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1716863663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1716863663 |ULTIMATE.start_main_#t~ite44_Out-1716863663|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716863663, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1716863663, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1716863663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1716863663} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716863663, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1716863663, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1716863663, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1716863663|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1716863663} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:33:47,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1735686831 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1735686831 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1735686831| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1735686831| ~y$r_buff0_thd0~0_In-1735686831) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1735686831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1735686831} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1735686831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1735686831, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1735686831|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:33:47,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1862894868 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1862894868 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1862894868 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1862894868 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1862894868 |ULTIMATE.start_main_#t~ite46_Out1862894868|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1862894868|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1862894868, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1862894868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1862894868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1862894868} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1862894868, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1862894868, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1862894868|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1862894868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1862894868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:33:47,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:33:47,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:33:47 BasicIcfg [2019-12-27 20:33:47,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:33:47,746 INFO L168 Benchmark]: Toolchain (without parser) took 121657.06 ms. Allocated memory was 139.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 102.6 MB in the beginning and 942.5 MB in the end (delta: -839.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 20:33:47,748 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:33:47,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.51 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 157.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:33:47,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:33:47,750 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:33:47,750 INFO L168 Benchmark]: RCFGBuilder took 844.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 105.3 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:33:47,751 INFO L168 Benchmark]: TraceAbstraction took 119882.00 ms. Allocated memory was 203.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 104.4 MB in the beginning and 942.5 MB in the end (delta: -838.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 20:33:47,756 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.51 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 157.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 105.3 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119882.00 ms. Allocated memory was 203.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 104.4 MB in the beginning and 942.5 MB in the end (delta: -838.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t642, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t643, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] FCALL, FORK 0 pthread_create(&t644, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 68.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7559 SDtfs, 13571 SDslu, 35114 SDs, 0 SdLazy, 39182 SolverSat, 1110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 255 SyntacticMatches, 125 SemanticMatches, 748 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18977 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred 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: 24.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 468930 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1138 ConstructedInterpolants, 0 QuantifiedInterpolants, 268541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...