/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:39:44,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:39:44,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:39:44,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:39:44,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:39:44,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:39:44,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:39:44,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:39:44,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:39:44,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:39:44,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:39:44,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:39:44,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:39:44,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:39:44,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:39:44,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:39:44,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:39:44,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:39:44,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:39:44,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:39:44,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:39:44,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:39:44,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:39:44,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:39:44,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:39:44,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:39:44,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:39:44,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:39:44,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:39:44,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:39:44,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:39:44,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:39:44,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:39:44,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:39:44,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:39:44,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:39:44,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:39:44,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:39:44,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:39:44,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:39:44,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:39:44,238 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-NoLbe-MCR.epf [2019-12-28 05:39:44,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:39:44,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:39:44,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:39:44,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:39:44,268 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:39:44,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:39:44,268 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:39:44,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:39:44,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:39:44,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:39:44,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:39:44,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:39:44,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:39:44,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:39:44,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:39:44,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:39:44,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:39:44,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:39:44,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:39:44,272 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:39:44,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:39:44,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:39:44,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:39:44,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:39:44,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:39:44,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:39:44,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:39:44,273 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:39:44,274 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:39:44,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:39:44,275 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:39:44,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:39:44,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:39:44,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:39:44,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:39:44,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:39:44,568 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:39:44,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2019-12-28 05:39:44,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd78224ea/7b5c1ce4222b4955ab52a503392afc10/FLAG2c11b7127 [2019-12-28 05:39:45,232 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:39:45,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2019-12-28 05:39:45,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd78224ea/7b5c1ce4222b4955ab52a503392afc10/FLAG2c11b7127 [2019-12-28 05:39:45,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd78224ea/7b5c1ce4222b4955ab52a503392afc10 [2019-12-28 05:39:45,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:39:45,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:39:45,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:39:45,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:39:45,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:39:45,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:39:45" (1/1) ... [2019-12-28 05:39:45,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3babf92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:45, skipping insertion in model container [2019-12-28 05:39:45,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:39:45" (1/1) ... [2019-12-28 05:39:45,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:39:45,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:39:46,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:39:46,354 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:39:46,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:39:46,847 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:39:46,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46 WrapperNode [2019-12-28 05:39:46,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:39:46,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:39:46,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:39:46,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:39:46,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:46,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:46,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:39:46,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:39:46,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:39:46,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:39:46,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:46,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:46,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:46,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:46,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:47,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:47,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (1/1) ... [2019-12-28 05:39:47,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:39:47,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:39:47,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:39:47,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:39:47,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39: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-28 05:39:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:39:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-28 05:39:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-28 05:39:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:39:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:39:47,112 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-28 05:39:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-28 05:39:47,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:39:47,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-28 05:39:47,116 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 05:39:47,882 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:39:47,883 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-28 05:39:47,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:39:47 BoogieIcfgContainer [2019-12-28 05:39:47,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:39:47,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:39:47,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:39:47,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:39:47,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:39:45" (1/3) ... [2019-12-28 05:39:47,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b6cda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:39:47, skipping insertion in model container [2019-12-28 05:39:47,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:39:46" (2/3) ... [2019-12-28 05:39:47,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b6cda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:39:47, skipping insertion in model container [2019-12-28 05:39:47,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:39:47" (3/3) ... [2019-12-28 05:39:47,892 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2019-12-28 05:39:47,902 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:39:47,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:39:47,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-28 05:39:47,912 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:39:47,946 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,946 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,946 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,947 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,947 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,947 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,947 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,948 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,948 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,948 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,948 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,948 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,949 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,949 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,949 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,949 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,950 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,950 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,950 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,950 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,951 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,951 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,951 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,951 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,952 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,952 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,952 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,952 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,953 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,953 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,953 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,953 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,953 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,954 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,954 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,954 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,954 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,955 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,955 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,955 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,955 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,956 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,956 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,956 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,956 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,957 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,961 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,961 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,961 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,962 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,962 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,962 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,962 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,963 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,963 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,970 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,970 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,970 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,972 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:47,972 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:39:48,005 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-28 05:39:48,027 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:39:48,028 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:39:48,028 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:39:48,028 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:39:48,028 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:39:48,029 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:39:48,029 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:39:48,029 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:39:48,053 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144 places, 148 transitions [2019-12-28 05:39:48,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4726 states. [2019-12-28 05:39:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4726 states. [2019-12-28 05:39:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-28 05:39:48,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:48,320 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] [2019-12-28 05:39:48,321 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1713283788, now seen corresponding path program 1 times [2019-12-28 05:39:48,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:48,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880511245] [2019-12-28 05:39:48,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:48,946 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-28 05:39:48,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880511245] [2019-12-28 05:39:48,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:48,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:48,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1905535891] [2019-12-28 05:39:48,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:48,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:48,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 32 transitions. [2019-12-28 05:39:48,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:48,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:48,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:48,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:49,006 INFO L87 Difference]: Start difference. First operand 4726 states. Second operand 6 states. [2019-12-28 05:39:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:49,471 INFO L93 Difference]: Finished difference Result 4729 states and 12880 transitions. [2019-12-28 05:39:49,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:39:49,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-28 05:39:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:49,512 INFO L225 Difference]: With dead ends: 4729 [2019-12-28 05:39:49,513 INFO L226 Difference]: Without dead ends: 3865 [2019-12-28 05:39:49,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-28 05:39:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-12-28 05:39:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3864. [2019-12-28 05:39:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2019-12-28 05:39:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 10475 transitions. [2019-12-28 05:39:49,871 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 10475 transitions. Word has length 32 [2019-12-28 05:39:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:49,871 INFO L462 AbstractCegarLoop]: Abstraction has 3864 states and 10475 transitions. [2019-12-28 05:39:49,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 10475 transitions. [2019-12-28 05:39:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-28 05:39:49,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:49,873 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] [2019-12-28 05:39:49,873 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash -251908973, now seen corresponding path program 1 times [2019-12-28 05:39:49,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:49,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107501452] [2019-12-28 05:39:49,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:50,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-28 05:39:50,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107501452] [2019-12-28 05:39:50,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:50,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:50,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701872869] [2019-12-28 05:39:50,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:50,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:50,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-28 05:39:50,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:50,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:50,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:50,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:50,076 INFO L87 Difference]: Start difference. First operand 3864 states and 10475 transitions. Second operand 6 states. [2019-12-28 05:39:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:50,451 INFO L93 Difference]: Finished difference Result 3866 states and 10477 transitions. [2019-12-28 05:39:50,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:39:50,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-28 05:39:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:50,473 INFO L225 Difference]: With dead ends: 3866 [2019-12-28 05:39:50,474 INFO L226 Difference]: Without dead ends: 3866 [2019-12-28 05:39:50,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 05:39:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2019-12-28 05:39:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 3862. [2019-12-28 05:39:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2019-12-28 05:39:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 10473 transitions. [2019-12-28 05:39:50,603 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 10473 transitions. Word has length 38 [2019-12-28 05:39:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:50,604 INFO L462 AbstractCegarLoop]: Abstraction has 3862 states and 10473 transitions. [2019-12-28 05:39:50,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 10473 transitions. [2019-12-28 05:39:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 05:39:50,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:50,615 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-28 05:39:50,615 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1207684161, now seen corresponding path program 1 times [2019-12-28 05:39:50,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:50,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284075112] [2019-12-28 05:39:50,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:50,953 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-28 05:39:50,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284075112] [2019-12-28 05:39:50,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:50,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:50,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148451613] [2019-12-28 05:39:50,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:50,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:50,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 05:39:50,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:50,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:50,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:50,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:50,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:50,981 INFO L87 Difference]: Start difference. First operand 3862 states and 10473 transitions. Second operand 6 states. [2019-12-28 05:39:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:51,634 INFO L93 Difference]: Finished difference Result 5826 states and 15811 transitions. [2019-12-28 05:39:51,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 05:39:51,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 05:39:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:51,671 INFO L225 Difference]: With dead ends: 5826 [2019-12-28 05:39:51,672 INFO L226 Difference]: Without dead ends: 5826 [2019-12-28 05:39:51,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-28 05:39:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5826 states. [2019-12-28 05:39:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5826 to 4386. [2019-12-28 05:39:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4386 states. [2019-12-28 05:39:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 11917 transitions. [2019-12-28 05:39:51,825 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 11917 transitions. Word has length 56 [2019-12-28 05:39:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:51,827 INFO L462 AbstractCegarLoop]: Abstraction has 4386 states and 11917 transitions. [2019-12-28 05:39:51,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 11917 transitions. [2019-12-28 05:39:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:39:51,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:51,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:39:51,833 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash -818897435, now seen corresponding path program 1 times [2019-12-28 05:39:51,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:51,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432995528] [2019-12-28 05:39:51,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:52,045 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-28 05:39:52,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432995528] [2019-12-28 05:39:52,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:52,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:39:52,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1178538791] [2019-12-28 05:39:52,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:52,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:52,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 05:39:52,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:52,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:39:52,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:39:52,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:52,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:39:52,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:39:52,146 INFO L87 Difference]: Start difference. First operand 4386 states and 11917 transitions. Second operand 6 states. [2019-12-28 05:39:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:52,714 INFO L93 Difference]: Finished difference Result 6350 states and 17159 transitions. [2019-12-28 05:39:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 05:39:52,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 05:39:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:52,766 INFO L225 Difference]: With dead ends: 6350 [2019-12-28 05:39:52,766 INFO L226 Difference]: Without dead ends: 5318 [2019-12-28 05:39:52,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:39:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-12-28 05:39:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5126. [2019-12-28 05:39:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5126 states. [2019-12-28 05:39:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 13986 transitions. [2019-12-28 05:39:52,928 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 13986 transitions. Word has length 62 [2019-12-28 05:39:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:52,928 INFO L462 AbstractCegarLoop]: Abstraction has 5126 states and 13986 transitions. [2019-12-28 05:39:52,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:39:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 13986 transitions. [2019-12-28 05:39:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 05:39:52,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:52,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:39:52,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:52,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1530943082, now seen corresponding path program 1 times [2019-12-28 05:39:52,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:52,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968540039] [2019-12-28 05:39:52,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:53,080 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-28 05:39:53,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968540039] [2019-12-28 05:39:53,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:53,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:39:53,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284375720] [2019-12-28 05:39:53,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:53,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:53,193 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 156 transitions. [2019-12-28 05:39:53,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:53,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 05:39:53,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:39:53,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:53,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:39:53,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:39:53,214 INFO L87 Difference]: Start difference. First operand 5126 states and 13986 transitions. Second operand 5 states. [2019-12-28 05:39:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:39:53,311 INFO L93 Difference]: Finished difference Result 1781 states and 4651 transitions. [2019-12-28 05:39:53,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:39:53,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-28 05:39:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:39:53,320 INFO L225 Difference]: With dead ends: 1781 [2019-12-28 05:39:53,320 INFO L226 Difference]: Without dead ends: 1781 [2019-12-28 05:39:53,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:39:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2019-12-28 05:39:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2019-12-28 05:39:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-12-28 05:39:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 4651 transitions. [2019-12-28 05:39:53,386 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 4651 transitions. Word has length 68 [2019-12-28 05:39:53,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:39:53,387 INFO L462 AbstractCegarLoop]: Abstraction has 1781 states and 4651 transitions. [2019-12-28 05:39:53,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:39:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 4651 transitions. [2019-12-28 05:39:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 05:39:53,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:39:53,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:39:53,396 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:39:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:39:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash 301082608, now seen corresponding path program 1 times [2019-12-28 05:39:53,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:39:53,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022108145] [2019-12-28 05:39:53,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:39:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:39:54,442 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-28 05:39:54,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022108145] [2019-12-28 05:39:54,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:39:54,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-28 05:39:54,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95501985] [2019-12-28 05:39:54,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:39:54,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:39:55,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 647 states and 1534 transitions. [2019-12-28 05:39:55,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:39:56,034 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,043 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,048 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:56,106 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,111 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,115 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:56,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:39:56,130 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:152, output treesize:29 [2019-12-28 05:39:56,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,324 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,329 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:56,384 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,390 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,394 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:39:56,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:39:56,407 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:39:56,407 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:168, output treesize:45 [2019-12-28 05:39:56,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 88 times. [2019-12-28 05:39:56,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-28 05:39:56,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:39:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-28 05:39:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2019-12-28 05:39:56,626 INFO L87 Difference]: Start difference. First operand 1781 states and 4651 transitions. Second operand 28 states. [2019-12-28 05:39:59,248 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-12-28 05:39:59,461 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-12-28 05:40:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:00,594 INFO L93 Difference]: Finished difference Result 2161 states and 5542 transitions. [2019-12-28 05:40:00,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 05:40:00,595 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2019-12-28 05:40:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:00,603 INFO L225 Difference]: With dead ends: 2161 [2019-12-28 05:40:00,604 INFO L226 Difference]: Without dead ends: 2161 [2019-12-28 05:40:00,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=399, Invalid=1493, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 05:40:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2019-12-28 05:40:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2153. [2019-12-28 05:40:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2019-12-28 05:40:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 5535 transitions. [2019-12-28 05:40:00,654 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 5535 transitions. Word has length 97 [2019-12-28 05:40:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:00,655 INFO L462 AbstractCegarLoop]: Abstraction has 2153 states and 5535 transitions. [2019-12-28 05:40:00,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-28 05:40:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 5535 transitions. [2019-12-28 05:40:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 05:40:00,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:00,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:40:00,661 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1741468244, now seen corresponding path program 2 times [2019-12-28 05:40:00,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:00,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536158841] [2019-12-28 05:40:00,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:01,798 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-28 05:40:01,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536158841] [2019-12-28 05:40:01,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:01,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-28 05:40:01,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237631769] [2019-12-28 05:40:01,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:01,826 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:02,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 432 states and 906 transitions. [2019-12-28 05:40:02,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:40:02,764 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-28 05:40:02,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:02,905 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:02,911 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:02,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:02,954 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:02,957 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:02,961 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:02,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:02,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:02,974 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:152, output treesize:29 [2019-12-28 05:40:03,051 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,055 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,064 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:03,120 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,124 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,128 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:03,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:03,144 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:176, output treesize:53 [2019-12-28 05:40:03,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,349 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,353 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:03,448 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,454 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,459 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:03,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:03,480 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:03,480 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:208, output treesize:85 [2019-12-28 05:40:03,738 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 50 times. [2019-12-28 05:40:03,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-28 05:40:03,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:40:03,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-28 05:40:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2019-12-28 05:40:03,740 INFO L87 Difference]: Start difference. First operand 2153 states and 5535 transitions. Second operand 34 states. [2019-12-28 05:40:05,748 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-28 05:40:06,072 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-28 05:40:06,435 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-12-28 05:40:07,933 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-12-28 05:40:08,238 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2019-12-28 05:40:08,661 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2019-12-28 05:40:09,923 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-12-28 05:40:10,153 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-12-28 05:40:10,340 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-12-28 05:40:10,692 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-12-28 05:40:10,908 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-12-28 05:40:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:10,916 INFO L93 Difference]: Finished difference Result 4036 states and 9885 transitions. [2019-12-28 05:40:10,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 05:40:10,916 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2019-12-28 05:40:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:10,926 INFO L225 Difference]: With dead ends: 4036 [2019-12-28 05:40:10,926 INFO L226 Difference]: Without dead ends: 4036 [2019-12-28 05:40:10,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=513, Invalid=2139, Unknown=0, NotChecked=0, Total=2652 [2019-12-28 05:40:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2019-12-28 05:40:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 2498. [2019-12-28 05:40:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-12-28 05:40:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 6483 transitions. [2019-12-28 05:40:11,005 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 6483 transitions. Word has length 97 [2019-12-28 05:40:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:11,006 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 6483 transitions. [2019-12-28 05:40:11,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-28 05:40:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 6483 transitions. [2019-12-28 05:40:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 05:40:11,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:11,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:40:11,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:11,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1914203890, now seen corresponding path program 3 times [2019-12-28 05:40:11,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:11,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34429455] [2019-12-28 05:40:11,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:11,983 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-28 05:40:11,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34429455] [2019-12-28 05:40:11,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:11,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-28 05:40:11,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1836605520] [2019-12-28 05:40:11,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:12,015 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:12,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 794 states and 1894 transitions. [2019-12-28 05:40:12,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:40:12,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,719 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,723 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,726 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,730 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,733 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,807 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,811 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,814 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,817 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,822 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,824 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:12,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:12,844 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-12-28 05:40:12,844 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:270, output treesize:24 [2019-12-28 05:40:13,739 WARN L192 SmtUtils]: Spent 636.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-28 05:40:14,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,767 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,770 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:14,810 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,814 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,817 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:14,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:14,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:14,830 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:152, output treesize:29 [2019-12-28 05:40:15,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,447 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,493 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,497 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,501 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:15,518 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:176, output treesize:53 [2019-12-28 05:40:15,717 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,722 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,726 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,773 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,776 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,779 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,786 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:15,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:15,804 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:208, output treesize:85 [2019-12-28 05:40:15,913 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,918 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,923 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,928 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,937 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:15,941 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,010 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,014 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,017 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,025 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,030 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,032 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-12-28 05:40:16,056 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:224, output treesize:26 [2019-12-28 05:40:16,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,536 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,542 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,607 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,611 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,616 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:16,636 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:279, output treesize:156 [2019-12-28 05:40:16,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,818 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,821 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,901 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,907 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,912 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:16,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:16,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-28 05:40:16,933 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:271, output treesize:148 [2019-12-28 05:40:18,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 119 times. [2019-12-28 05:40:18,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-12-28 05:40:18,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:40:18,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-12-28 05:40:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3368, Unknown=0, NotChecked=0, Total=3540 [2019-12-28 05:40:18,790 INFO L87 Difference]: Start difference. First operand 2498 states and 6483 transitions. Second operand 60 states. [2019-12-28 05:40:22,829 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-28 05:40:23,748 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-28 05:40:24,107 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-12-28 05:40:24,775 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-12-28 05:40:25,117 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-28 05:40:25,743 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-12-28 05:40:29,475 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 40 [2019-12-28 05:40:29,995 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2019-12-28 05:40:30,814 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-12-28 05:40:31,615 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 37 [2019-12-28 05:40:32,821 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 44 [2019-12-28 05:40:33,357 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 41 [2019-12-28 05:40:34,758 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 48 [2019-12-28 05:40:35,394 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 45 [2019-12-28 05:40:36,503 WARN L192 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 63 [2019-12-28 05:40:37,907 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-28 05:40:38,182 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-28 05:40:38,390 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-28 05:40:38,688 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-28 05:40:38,927 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-12-28 05:40:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:38,935 INFO L93 Difference]: Finished difference Result 2496 states and 6481 transitions. [2019-12-28 05:40:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 05:40:38,935 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 97 [2019-12-28 05:40:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:38,946 INFO L225 Difference]: With dead ends: 2496 [2019-12-28 05:40:38,946 INFO L226 Difference]: Without dead ends: 2496 [2019-12-28 05:40:38,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=1142, Invalid=7048, Unknown=0, NotChecked=0, Total=8190 [2019-12-28 05:40:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2019-12-28 05:40:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1779. [2019-12-28 05:40:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-12-28 05:40:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 4649 transitions. [2019-12-28 05:40:38,994 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 4649 transitions. Word has length 97 [2019-12-28 05:40:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:38,994 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 4649 transitions. [2019-12-28 05:40:38,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-12-28 05:40:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 4649 transitions. [2019-12-28 05:40:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:40:38,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:38,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:40:38,999 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash -591260438, now seen corresponding path program 1 times [2019-12-28 05:40:39,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:39,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022717272] [2019-12-28 05:40:39,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:39,491 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-12-28 05:40:40,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-28 05:40:40,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022717272] [2019-12-28 05:40:40,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:40,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-28 05:40:40,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896950753] [2019-12-28 05:40:40,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:40,853 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:41,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 653 states and 1540 transitions. [2019-12-28 05:40:41,251 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:40:41,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:41,922 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:41,948 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:41,952 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:41,955 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:41,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:41,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-28 05:40:41,968 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:26 [2019-12-28 05:40:42,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:42,147 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:42,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:42,181 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:42,184 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:40:42,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:40:42,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-28 05:40:42,199 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:42 [2019-12-28 05:40:42,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 91 times. [2019-12-28 05:40:42,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-28 05:40:42,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:40:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-28 05:40:42,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 05:40:42,495 INFO L87 Difference]: Start difference. First operand 1779 states and 4649 transitions. Second operand 37 states. [2019-12-28 05:40:44,024 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-12-28 05:40:44,377 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-12-28 05:40:44,659 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-28 05:40:45,060 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-12-28 05:40:45,441 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-28 05:40:45,650 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-28 05:40:46,905 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-28 05:40:47,142 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-12-28 05:40:47,420 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-12-28 05:40:47,687 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-28 05:40:47,982 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-28 05:40:48,511 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-28 05:40:48,811 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-28 05:40:49,079 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-12-28 05:40:49,348 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-28 05:40:49,658 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-28 05:40:50,399 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-12-28 05:40:50,693 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-12-28 05:40:51,170 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-12-28 05:40:51,429 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-28 05:40:51,841 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-12-28 05:40:52,247 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-12-28 05:40:52,818 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-12-28 05:40:53,161 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-12-28 05:40:53,443 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-12-28 05:40:53,731 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-12-28 05:40:53,969 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-12-28 05:40:54,354 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-28 05:40:54,760 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-28 05:40:55,723 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-28 05:40:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:40:56,949 INFO L93 Difference]: Finished difference Result 3032 states and 7605 transitions. [2019-12-28 05:40:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-28 05:40:56,950 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2019-12-28 05:40:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:40:56,954 INFO L225 Difference]: With dead ends: 3032 [2019-12-28 05:40:56,955 INFO L226 Difference]: Without dead ends: 2357 [2019-12-28 05:40:56,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1009, Invalid=5633, Unknown=0, NotChecked=0, Total=6642 [2019-12-28 05:40:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2019-12-28 05:40:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1635. [2019-12-28 05:40:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-12-28 05:40:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 4229 transitions. [2019-12-28 05:40:56,999 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 4229 transitions. Word has length 103 [2019-12-28 05:40:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:40:56,999 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 4229 transitions. [2019-12-28 05:40:56,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-28 05:40:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 4229 transitions. [2019-12-28 05:40:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:40:57,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:40:57,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:40:57,004 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:40:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:40:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1384316822, now seen corresponding path program 2 times [2019-12-28 05:40:57,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:40:57,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688352273] [2019-12-28 05:40:57,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:40:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:40:58,642 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-28 05:40:58,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688352273] [2019-12-28 05:40:58,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:40:58,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-28 05:40:58,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947489651] [2019-12-28 05:40:58,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:40:58,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:40:59,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 706 states and 1690 transitions. [2019-12-28 05:40:59,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:41:00,047 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,050 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,055 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,058 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:00,114 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,117 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,120 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,122 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:00,140 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-28 05:41:00,140 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:202, output treesize:38 [2019-12-28 05:41:00,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,559 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:00,611 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,616 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:00,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:00,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-28 05:41:00,632 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:26 [2019-12-28 05:41:01,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,081 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,109 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,112 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-28 05:41:01,126 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:42 [2019-12-28 05:41:01,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,681 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,721 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,725 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,737 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-28 05:41:01,737 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:78 [2019-12-28 05:41:01,873 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,876 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,911 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,914 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-28 05:41:01,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-28 05:41:01,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-28 05:41:01,927 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:156, output treesize:74 [2019-12-28 05:41:02,192 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 86 times. [2019-12-28 05:41:02,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-28 05:41:02,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:41:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-28 05:41:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2019-12-28 05:41:02,195 INFO L87 Difference]: Start difference. First operand 1635 states and 4229 transitions. Second operand 47 states. [2019-12-28 05:41:04,499 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-28 05:41:04,820 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-12-28 05:41:05,308 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-12-28 05:41:05,748 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-28 05:41:06,394 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-28 05:41:06,716 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-28 05:41:07,010 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-12-28 05:41:07,257 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-12-28 05:41:07,542 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-12-28 05:41:07,977 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-12-28 05:41:08,536 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-12-28 05:41:08,923 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-12-28 05:41:09,213 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-12-28 05:41:09,743 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-12-28 05:41:10,315 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-12-28 05:41:10,823 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-12-28 05:41:11,197 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-28 05:41:11,606 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-12-28 05:41:12,113 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-12-28 05:41:12,497 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-12-28 05:41:12,966 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-12-28 05:41:13,437 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 90 [2019-12-28 05:41:14,022 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-12-28 05:41:14,768 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 97 [2019-12-28 05:41:15,264 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-12-28 05:41:15,708 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-12-28 05:41:16,045 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-28 05:41:16,436 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-12-28 05:41:18,268 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-12-28 05:41:18,663 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-28 05:41:19,084 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-28 05:41:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:41:19,735 INFO L93 Difference]: Finished difference Result 2695 states and 6774 transitions. [2019-12-28 05:41:19,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-28 05:41:19,735 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 103 [2019-12-28 05:41:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:41:19,740 INFO L225 Difference]: With dead ends: 2695 [2019-12-28 05:41:19,740 INFO L226 Difference]: Without dead ends: 2164 [2019-12-28 05:41:19,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1180, Invalid=7562, Unknown=0, NotChecked=0, Total=8742 [2019-12-28 05:41:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-12-28 05:41:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1714. [2019-12-28 05:41:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2019-12-28 05:41:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 4380 transitions. [2019-12-28 05:41:19,782 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 4380 transitions. Word has length 103 [2019-12-28 05:41:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:41:19,782 INFO L462 AbstractCegarLoop]: Abstraction has 1714 states and 4380 transitions. [2019-12-28 05:41:19,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-28 05:41:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 4380 transitions. [2019-12-28 05:41:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 05:41:19,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:41:19,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 05:41:19,787 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:41:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:41:19,787 INFO L82 PathProgramCache]: Analyzing trace with hash 233242022, now seen corresponding path program 3 times [2019-12-28 05:41:19,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:41:19,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580880035] [2019-12-28 05:41:19,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:41:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:41:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:41:19,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 05:41:19,930 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 05:41:20,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:41:20 BasicIcfg [2019-12-28 05:41:20,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:41:20,033 INFO L168 Benchmark]: Toolchain (without parser) took 94532.98 ms. Allocated memory was 137.9 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 97.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 425.4 MB. Max. memory is 7.1 GB. [2019-12-28 05:41:20,034 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 05:41:20,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1346.48 ms. Allocated memory was 137.9 MB in the beginning and 237.0 MB in the end (delta: 99.1 MB). Free memory was 97.7 MB in the beginning and 172.7 MB in the end (delta: -75.0 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. [2019-12-28 05:41:20,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.58 ms. Allocated memory is still 237.0 MB. Free memory was 172.7 MB in the beginning and 168.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-12-28 05:41:20,035 INFO L168 Benchmark]: Boogie Preprocessor took 79.03 ms. Allocated memory is still 237.0 MB. Free memory was 168.3 MB in the beginning and 166.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-12-28 05:41:20,035 INFO L168 Benchmark]: RCFGBuilder took 855.66 ms. Allocated memory is still 237.0 MB. Free memory was 166.8 MB in the beginning and 118.6 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2019-12-28 05:41:20,036 INFO L168 Benchmark]: TraceAbstraction took 92146.10 ms. Allocated memory was 237.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 118.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 347.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:41:20,038 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.18 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1346.48 ms. Allocated memory was 137.9 MB in the beginning and 237.0 MB in the end (delta: 99.1 MB). Free memory was 97.7 MB in the beginning and 172.7 MB in the end (delta: -75.0 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.58 ms. Allocated memory is still 237.0 MB. Free memory was 172.7 MB in the beginning and 168.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.03 ms. Allocated memory is still 237.0 MB. Free memory was 168.3 MB in the beginning and 166.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 855.66 ms. Allocated memory is still 237.0 MB. Free memory was 166.8 MB in the beginning and 118.6 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92146.10 ms. Allocated memory was 237.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 118.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 347.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; VAL [t1={5:0}, t2={6:0}] [L1695] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1727] 0 return 0; VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1736] 0 struct my_data data; VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1705] 0 data->shared.a = 0 VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1706] 0 data->shared.b = 0 VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1707] 0 data->shared.a VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1682] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1708] 0 data->shared.b VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1682] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [my_dev={0:0}, t1={5:0}, t2={6:0}] [L1712] 0 my_dev = &data->dev VAL [my_dev={7:24}, t1={5:0}, t2={6:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1697] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1699] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1700] 1 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1715] 0 return 0; VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1697] 2 struct my_data *data; VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1699] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1700] 2 data->shared.b = data->shared.b + 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1700] 1 data->shared.b = data->shared.b + 1 VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1738] COND TRUE 0 probe_ret==0 VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1721] 0 void *status; VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1722] 0 \read(t1) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1740] 0 data.shared.a VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1682] COND FALSE 0 !(!expression) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1741] 0 data.shared.b VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1682] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={5:0}, t2={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Result: UNSAFE, OverallTime: 91.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 65.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1868 SDtfs, 6502 SDslu, 26935 SDs, 0 SdLazy, 15899 SolverSat, 742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 370 SyntacticMatches, 9 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5351 ImplicationChecksByTransitivity, 48.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5126occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 5072 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 804131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...