/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:47:05,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:47:05,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:47:05,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:47:05,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:47:05,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:47:05,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:47:05,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:47:05,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:47:05,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:47:05,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:47:05,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:47:05,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:47:05,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:47:05,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:47:05,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:47:05,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:47:05,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:47:05,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:47:05,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:47:05,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:47:05,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:47:05,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:47:05,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:47:05,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:47:05,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:47:05,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:47:05,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:47:05,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:47:05,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:47:05,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:47:05,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:47:05,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:47:05,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:47:05,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:47:05,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:47:05,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:47:05,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:47:05,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:47:05,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:47:05,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:47:05,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:47:05,656 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:47:05,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:47:05,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:47:05,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:47:05,658 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:47:05,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:47:05,658 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:47:05,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:47:05,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:47:05,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:47:05,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:47:05,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:47:05,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:47:05,660 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:47:05,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:47:05,660 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:47:05,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:47:05,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:47:05,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:47:05,661 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:47:05,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:47:05,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:47:05,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:47:05,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:47:05,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:47:05,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:47:05,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:47:05,662 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:47:05,663 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:47:05,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:47:05,663 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:47:05,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:47:05,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:47:05,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:47:05,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:47:05,974 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:47:05,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-22 00:47:06,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e95bbc3d3/31cb0c2e70c441faa265a631477b67b7/FLAG9acd4376d [2020-10-22 00:47:06,638 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:47:06,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-22 00:47:06,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e95bbc3d3/31cb0c2e70c441faa265a631477b67b7/FLAG9acd4376d [2020-10-22 00:47:06,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e95bbc3d3/31cb0c2e70c441faa265a631477b67b7 [2020-10-22 00:47:06,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:47:06,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:47:06,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:47:06,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:47:06,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:47:06,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:47:06" (1/1) ... [2020-10-22 00:47:06,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c0085c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:06, skipping insertion in model container [2020-10-22 00:47:06,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:47:06" (1/1) ... [2020-10-22 00:47:06,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:47:06,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:47:07,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:47:07,782 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:47:07,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:47:08,294 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:47:08,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08 WrapperNode [2020-10-22 00:47:08,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:47:08,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:47:08,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:47:08,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:47:08,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:47:08,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:47:08,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:47:08,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:47:08,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... [2020-10-22 00:47:08,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:47:08,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:47:08,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:47:08,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:47:08,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:47:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:47:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 00:47:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-22 00:47:08,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-22 00:47:08,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:47:08,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:47:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-22 00:47:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-22 00:47:08,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:47:08,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:47:08,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:47:08,603 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:47:09,496 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:47:09,497 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-22 00:47:09,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:47:09 BoogieIcfgContainer [2020-10-22 00:47:09,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:47:09,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:47:09,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:47:09,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:47:09,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:47:06" (1/3) ... [2020-10-22 00:47:09,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f467505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:47:09, skipping insertion in model container [2020-10-22 00:47:09,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:47:08" (2/3) ... [2020-10-22 00:47:09,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f467505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:47:09, skipping insertion in model container [2020-10-22 00:47:09,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:47:09" (3/3) ... [2020-10-22 00:47:09,510 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-22 00:47:09,527 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:47:09,527 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:47:09,535 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-22 00:47:09,537 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:47:09,572 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,572 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,573 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,573 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,574 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,575 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,576 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,576 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,576 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,576 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,577 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,578 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,578 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,579 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,579 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,580 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,580 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,582 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,582 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,582 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,582 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,583 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,583 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,583 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,583 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,583 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,584 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,584 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,584 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,584 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,585 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,585 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,585 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,586 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,586 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,590 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,590 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,591 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,591 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,591 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,591 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,592 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,592 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,592 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,592 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,599 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,599 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,599 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,600 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,600 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,600 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,600 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,601 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,601 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:47:09,611 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-22 00:47:09,626 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-22 00:47:09,648 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:47:09,648 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:47:09,649 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:47:09,649 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:47:09,649 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:47:09,649 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:47:09,649 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:47:09,650 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:47:09,669 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:47:09,669 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 188 transitions, 398 flow [2020-10-22 00:47:09,672 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 188 transitions, 398 flow [2020-10-22 00:47:09,675 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 178 places, 188 transitions, 398 flow [2020-10-22 00:47:09,779 INFO L129 PetriNetUnfolder]: 19/236 cut-off events. [2020-10-22 00:47:09,779 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-22 00:47:09,786 INFO L80 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 236 events. 19/236 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 492 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-10-22 00:47:09,793 INFO L116 LiptonReduction]: Number of co-enabled transitions 3172 [2020-10-22 00:47:13,116 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-22 00:47:13,381 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:13,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:13,414 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:13,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:13,439 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:13,440 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-22 00:47:13,764 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-22 00:47:14,120 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2020-10-22 00:47:14,139 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:14,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:14,281 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:14,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:14,377 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:14,377 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:160, output treesize:132 [2020-10-22 00:47:15,365 WARN L193 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-22 00:47:15,711 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-22 00:47:17,121 WARN L193 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2020-10-22 00:47:17,517 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-22 00:47:19,167 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2020-10-22 00:47:19,198 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:20,020 WARN L193 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-10-22 00:47:20,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:20,047 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:20,782 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-22 00:47:20,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:20,786 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:20,786 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-10-22 00:47:21,571 WARN L193 SmtUtils]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-22 00:47:21,591 INFO L131 LiptonReduction]: Checked pairs total: 8034 [2020-10-22 00:47:21,591 INFO L133 LiptonReduction]: Total number of compositions: 229 [2020-10-22 00:47:21,597 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-22 00:47:21,642 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-22 00:47:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-22 00:47:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-22 00:47:21,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:21,657 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-22 00:47:21,657 INFO L429 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]=== [2020-10-22 00:47:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 711, now seen corresponding path program 1 times [2020-10-22 00:47:21,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:21,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824526004] [2020-10-22 00:47:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:21,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824526004] [2020-10-22 00:47:21,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:21,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-22 00:47:21,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418875712] [2020-10-22 00:47:21,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:21,915 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:21,924 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-10-22 00:47:21,924 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:21,929 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:21,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-22 00:47:21,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-22 00:47:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-22 00:47:21,948 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-22 00:47:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:21,983 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-22 00:47:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-22 00:47:21,984 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-22 00:47:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:22,001 INFO L225 Difference]: With dead ends: 423 [2020-10-22 00:47:22,001 INFO L226 Difference]: Without dead ends: 385 [2020-10-22 00:47:22,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-22 00:47:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-22 00:47:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-22 00:47:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-22 00:47:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-22 00:47:22,095 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-22 00:47:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:22,095 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-22 00:47:22,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-22 00:47:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-22 00:47:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-22 00:47:22,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:22,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-22 00:47:22,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:47:22,097 INFO L429 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]=== [2020-10-22 00:47:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash 21756108, now seen corresponding path program 1 times [2020-10-22 00:47:22,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:22,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449382711] [2020-10-22 00:47:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:22,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449382711] [2020-10-22 00:47:22,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:22,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:47:22,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1526688655] [2020-10-22 00:47:22,304 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:22,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:22,306 INFO L252 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-10-22 00:47:22,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:22,307 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:22,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:47:22,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:47:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:47:22,309 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-22 00:47:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:22,464 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-22 00:47:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:47:22,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-22 00:47:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:22,476 INFO L225 Difference]: With dead ends: 540 [2020-10-22 00:47:22,476 INFO L226 Difference]: Without dead ends: 540 [2020-10-22 00:47:22,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:47:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-22 00:47:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-22 00:47:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-22 00:47:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-22 00:47:22,581 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-22 00:47:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:22,581 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-22 00:47:22,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:47:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-22 00:47:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-22 00:47:22,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:22,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-22 00:47:22,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:47:22,584 INFO L429 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]=== [2020-10-22 00:47:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash -567208386, now seen corresponding path program 1 times [2020-10-22 00:47:22,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:22,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364112496] [2020-10-22 00:47:22,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:22,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364112496] [2020-10-22 00:47:22,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:22,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:47:22,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821518287] [2020-10-22 00:47:22,729 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:22,730 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:22,733 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-10-22 00:47:22,734 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:22,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:22,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:47:22,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:47:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:47:22,737 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-10-22 00:47:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:22,868 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-10-22 00:47:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:47:22,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-10-22 00:47:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:22,873 INFO L225 Difference]: With dead ends: 599 [2020-10-22 00:47:22,873 INFO L226 Difference]: Without dead ends: 514 [2020-10-22 00:47:22,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:47:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-22 00:47:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-22 00:47:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-22 00:47:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-22 00:47:22,894 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-22 00:47:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:22,895 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-22 00:47:22,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:47:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-22 00:47:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:47:22,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:22,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:22,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:47:22,898 INFO L429 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]=== [2020-10-22 00:47:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash 164889039, now seen corresponding path program 1 times [2020-10-22 00:47:22,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:22,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761305059] [2020-10-22 00:47:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:22,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761305059] [2020-10-22 00:47:22,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:22,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:47:22,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100436732] [2020-10-22 00:47:22,969 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:22,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:22,973 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 20 transitions. [2020-10-22 00:47:22,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:23,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:23,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:47:23,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:23,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:47:23,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:47:23,095 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-22 00:47:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:23,114 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-22 00:47:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:47:23,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:47:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:23,118 INFO L225 Difference]: With dead ends: 162 [2020-10-22 00:47:23,118 INFO L226 Difference]: Without dead ends: 162 [2020-10-22 00:47:23,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:47:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-22 00:47:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-22 00:47:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-22 00:47:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-22 00:47:23,124 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-22 00:47:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:23,125 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-22 00:47:23,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:47:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-22 00:47:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:23,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:23,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:23,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:47:23,135 INFO L429 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]=== [2020-10-22 00:47:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash -976645078, now seen corresponding path program 1 times [2020-10-22 00:47:23,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:23,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737246990] [2020-10-22 00:47:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:23,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737246990] [2020-10-22 00:47:23,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:23,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-22 00:47:23,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1629886794] [2020-10-22 00:47:23,430 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:23,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:23,450 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 34 transitions. [2020-10-22 00:47:23,451 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:23,642 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 12 [2020-10-22 00:47:23,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:47:23,725 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:23,727 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:23,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:23,760 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:23,761 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:23,769 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:23,769 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:23,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:23,775 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_104| vanished before elimination [2020-10-22 00:47:23,775 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:23,776 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-10-22 00:47:23,776 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:105, output treesize:23 [2020-10-22 00:47:23,777 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:23,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:47:23,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:23,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:47:23,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:47:23,778 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-10-22 00:47:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:24,247 INFO L93 Difference]: Finished difference Result 144 states and 313 transitions. [2020-10-22 00:47:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:47:24,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-22 00:47:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:24,249 INFO L225 Difference]: With dead ends: 144 [2020-10-22 00:47:24,249 INFO L226 Difference]: Without dead ends: 144 [2020-10-22 00:47:24,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2020-10-22 00:47:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-22 00:47:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-10-22 00:47:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-22 00:47:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 313 transitions. [2020-10-22 00:47:24,254 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 313 transitions. Word has length 22 [2020-10-22 00:47:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:24,254 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 313 transitions. [2020-10-22 00:47:24,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:47:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 313 transitions. [2020-10-22 00:47:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:24,256 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:24,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:24,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:47:24,256 INFO L429 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]=== [2020-10-22 00:47:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash -834725520, now seen corresponding path program 1 times [2020-10-22 00:47:24,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:24,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191683980] [2020-10-22 00:47:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:24,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191683980] [2020-10-22 00:47:24,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:24,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:47:24,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402134098] [2020-10-22 00:47:24,429 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:24,435 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:24,447 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-10-22 00:47:24,447 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:24,517 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:24,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:47:24,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:47:24,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:47:24,518 INFO L87 Difference]: Start difference. First operand 144 states and 313 transitions. Second operand 4 states. [2020-10-22 00:47:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:24,544 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2020-10-22 00:47:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:47:24,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-22 00:47:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:24,546 INFO L225 Difference]: With dead ends: 96 [2020-10-22 00:47:24,546 INFO L226 Difference]: Without dead ends: 96 [2020-10-22 00:47:24,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:47:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-22 00:47:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-10-22 00:47:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-22 00:47:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2020-10-22 00:47:24,549 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 161 transitions. Word has length 22 [2020-10-22 00:47:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:24,550 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 161 transitions. [2020-10-22 00:47:24,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:47:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 161 transitions. [2020-10-22 00:47:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:24,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:24,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:24,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:47:24,551 INFO L429 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]=== [2020-10-22 00:47:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash 663150838, now seen corresponding path program 2 times [2020-10-22 00:47:24,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:24,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521021074] [2020-10-22 00:47:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:25,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521021074] [2020-10-22 00:47:25,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:25,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-22 00:47:25,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222326903] [2020-10-22 00:47:25,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:25,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:25,413 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-10-22 00:47:25,413 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:25,438 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:25,439 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,443 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:25,444 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,448 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:25,449 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,454 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:25,455 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,459 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:25,460 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,475 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:25,476 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:25,488 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:25,488 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:106, output treesize:40 [2020-10-22 00:47:25,513 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 00:47:25,522 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,525 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,530 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:25,534 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:25,538 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,542 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:25,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:25,561 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2020-10-22 00:47:25,561 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:144, output treesize:58 [2020-10-22 00:47:25,562 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:25,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:47:25,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:47:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:47:25,563 INFO L87 Difference]: Start difference. First operand 96 states and 161 transitions. Second operand 11 states. [2020-10-22 00:47:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:26,183 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2020-10-22 00:47:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:47:26,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-22 00:47:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:26,185 INFO L225 Difference]: With dead ends: 128 [2020-10-22 00:47:26,185 INFO L226 Difference]: Without dead ends: 128 [2020-10-22 00:47:26,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-10-22 00:47:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-22 00:47:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2020-10-22 00:47:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-22 00:47:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 210 transitions. [2020-10-22 00:47:26,190 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 210 transitions. Word has length 22 [2020-10-22 00:47:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:26,191 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 210 transitions. [2020-10-22 00:47:26,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:47:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2020-10-22 00:47:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:26,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:26,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:26,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:47:26,192 INFO L429 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]=== [2020-10-22 00:47:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash 663150822, now seen corresponding path program 1 times [2020-10-22 00:47:26,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:26,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374166542] [2020-10-22 00:47:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:26,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374166542] [2020-10-22 00:47:26,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:26,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:47:26,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1584498825] [2020-10-22 00:47:26,455 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:26,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:26,469 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-10-22 00:47:26,469 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:26,484 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:26,485 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,489 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:26,490 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,494 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:26,494 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,498 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:26,499 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:26,507 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:26,507 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:60, output treesize:16 [2020-10-22 00:47:26,535 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,537 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,539 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,541 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:26,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:26,548 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:26,548 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:14 [2020-10-22 00:47:26,566 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:26,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:47:26,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:47:26,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:47:26,567 INFO L87 Difference]: Start difference. First operand 127 states and 210 transitions. Second operand 8 states. [2020-10-22 00:47:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:26,870 INFO L93 Difference]: Finished difference Result 164 states and 259 transitions. [2020-10-22 00:47:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:47:26,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-22 00:47:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:26,873 INFO L225 Difference]: With dead ends: 164 [2020-10-22 00:47:26,873 INFO L226 Difference]: Without dead ends: 136 [2020-10-22 00:47:26,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-22 00:47:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-10-22 00:47:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-22 00:47:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 200 transitions. [2020-10-22 00:47:26,878 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 200 transitions. Word has length 22 [2020-10-22 00:47:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:26,878 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 200 transitions. [2020-10-22 00:47:26,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:47:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 200 transitions. [2020-10-22 00:47:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:26,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:26,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:26,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:47:26,880 INFO L429 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]=== [2020-10-22 00:47:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -917977872, now seen corresponding path program 3 times [2020-10-22 00:47:26,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:26,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645311898] [2020-10-22 00:47:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:27,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645311898] [2020-10-22 00:47:27,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:27,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-22 00:47:27,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20550005] [2020-10-22 00:47:27,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:27,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:27,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 48 transitions. [2020-10-22 00:47:27,592 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:27,720 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:47:27,732 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:27,733 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:27,735 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:27,751 INFO L625 ElimStorePlain]: treesize reduction 9, result has 73.5 percent of original size [2020-10-22 00:47:27,752 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-10-22 00:47:27,753 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:84, output treesize:25 [2020-10-22 00:47:28,351 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-22 00:47:28,372 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:28,372 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:28,381 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:28,382 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:28,387 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:28,388 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:28,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:28,429 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:28,430 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:28,435 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:28,435 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:28,440 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:28,440 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:28,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:28,456 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_111| vanished before elimination [2020-10-22 00:47:28,456 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_111| vanished before elimination [2020-10-22 00:47:28,456 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-22 00:47:28,456 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:159, output treesize:36 [2020-10-22 00:47:28,813 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:28,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:47:28,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:28,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:47:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:47:28,815 INFO L87 Difference]: Start difference. First operand 121 states and 200 transitions. Second operand 11 states. [2020-10-22 00:47:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:29,442 INFO L93 Difference]: Finished difference Result 189 states and 307 transitions. [2020-10-22 00:47:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-22 00:47:29,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-22 00:47:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:29,445 INFO L225 Difference]: With dead ends: 189 [2020-10-22 00:47:29,445 INFO L226 Difference]: Without dead ends: 189 [2020-10-22 00:47:29,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-22 00:47:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-22 00:47:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2020-10-22 00:47:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-22 00:47:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 242 transitions. [2020-10-22 00:47:29,458 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 242 transitions. Word has length 22 [2020-10-22 00:47:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:29,459 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 242 transitions. [2020-10-22 00:47:29,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:47:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 242 transitions. [2020-10-22 00:47:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:29,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:29,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:29,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:47:29,460 INFO L429 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]=== [2020-10-22 00:47:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:29,460 INFO L82 PathProgramCache]: Analyzing trace with hash -917977888, now seen corresponding path program 2 times [2020-10-22 00:47:29,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:29,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306657856] [2020-10-22 00:47:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:29,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306657856] [2020-10-22 00:47:29,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:29,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:47:29,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1349863853] [2020-10-22 00:47:29,742 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:29,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:29,757 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 48 transitions. [2020-10-22 00:47:29,757 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:29,864 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:47:29,868 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:29,870 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:29,873 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:29,886 INFO L625 ElimStorePlain]: treesize reduction 17, result has 50.0 percent of original size [2020-10-22 00:47:29,887 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:47:29,887 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:84, output treesize:17 [2020-10-22 00:47:30,238 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,242 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,245 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,248 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:30,280 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:30,280 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,284 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:30,284 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,291 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:30,292 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,295 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:30,296 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:30,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:30,306 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_115| vanished before elimination [2020-10-22 00:47:30,306 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:30,306 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:30,307 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:179, output treesize:15 [2020-10-22 00:47:30,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:30,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:47:30,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:47:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:47:30,432 INFO L87 Difference]: Start difference. First operand 147 states and 242 transitions. Second operand 8 states. [2020-10-22 00:47:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:30,710 INFO L93 Difference]: Finished difference Result 195 states and 303 transitions. [2020-10-22 00:47:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:47:30,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-22 00:47:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:30,712 INFO L225 Difference]: With dead ends: 195 [2020-10-22 00:47:30,713 INFO L226 Difference]: Without dead ends: 181 [2020-10-22 00:47:30,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:47:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-22 00:47:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2020-10-22 00:47:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-22 00:47:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-10-22 00:47:30,721 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-10-22 00:47:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:30,721 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-10-22 00:47:30,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:47:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-10-22 00:47:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:30,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:30,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:30,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:47:30,724 INFO L429 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]=== [2020-10-22 00:47:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1049502960, now seen corresponding path program 4 times [2020-10-22 00:47:30,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:30,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373009082] [2020-10-22 00:47:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:31,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373009082] [2020-10-22 00:47:31,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:31,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-22 00:47:31,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532511391] [2020-10-22 00:47:31,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:31,372 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:31,382 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-10-22 00:47:31,382 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:31,630 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-10-22 00:47:31,653 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,659 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,661 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,664 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,668 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,671 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:31,720 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,723 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,725 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,728 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,730 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,733 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:31,746 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:31,747 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-10-22 00:47:31,747 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:31,747 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:31,747 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:289, output treesize:43 [2020-10-22 00:47:32,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8285#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.offset |ULTIMATE.start_main_~#data~1.offset|) (< 0 (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28))) (<= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork1_~data~0.base)))] [2020-10-22 00:47:32,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:47:32,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:47:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:32,076 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 12 states. [2020-10-22 00:47:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:32,878 INFO L93 Difference]: Finished difference Result 198 states and 318 transitions. [2020-10-22 00:47:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-22 00:47:32,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 00:47:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:32,880 INFO L225 Difference]: With dead ends: 198 [2020-10-22 00:47:32,881 INFO L226 Difference]: Without dead ends: 176 [2020-10-22 00:47:32,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-22 00:47:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-22 00:47:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 153. [2020-10-22 00:47:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-22 00:47:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 249 transitions. [2020-10-22 00:47:32,886 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 249 transitions. Word has length 22 [2020-10-22 00:47:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:32,886 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 249 transitions. [2020-10-22 00:47:32,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:47:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 249 transitions. [2020-10-22 00:47:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:32,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:32,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:32,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:47:32,888 INFO L429 AbstractCegarLoop]: === Iteration 12 === [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]=== [2020-10-22 00:47:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:32,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1794260320, now seen corresponding path program 3 times [2020-10-22 00:47:32,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:32,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516806423] [2020-10-22 00:47:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:33,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516806423] [2020-10-22 00:47:33,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:33,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:47:33,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457498256] [2020-10-22 00:47:33,149 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:33,155 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:33,167 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2020-10-22 00:47:33,168 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:33,246 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:33,247 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,251 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:33,252 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,255 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:33,255 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,262 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:33,263 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:33,272 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:33,272 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:60, output treesize:16 [2020-10-22 00:47:33,510 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,513 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,517 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,520 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,554 INFO L625 ElimStorePlain]: treesize reduction 59, result has 21.3 percent of original size [2020-10-22 00:47:33,554 INFO L513 ElimStorePlain]: Eliminatee |#pthreadsMutex| vanished before elimination [2020-10-22 00:47:33,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:33,555 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:143, output treesize:16 [2020-10-22 00:47:33,634 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:47:33,634 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,638 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:47:33,638 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,640 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:47:33,640 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,641 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:47:33,642 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:33,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:33,649 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:33,649 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:75, output treesize:16 [2020-10-22 00:47:33,676 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8812#(and (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| ~my_dev~0.base)) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|))] [2020-10-22 00:47:33,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:47:33,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:47:33,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:47:33,678 INFO L87 Difference]: Start difference. First operand 153 states and 249 transitions. Second operand 9 states. [2020-10-22 00:47:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:34,055 INFO L93 Difference]: Finished difference Result 159 states and 254 transitions. [2020-10-22 00:47:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:47:34,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-22 00:47:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:34,057 INFO L225 Difference]: With dead ends: 159 [2020-10-22 00:47:34,057 INFO L226 Difference]: Without dead ends: 135 [2020-10-22 00:47:34,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:47:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-22 00:47:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2020-10-22 00:47:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-22 00:47:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 183 transitions. [2020-10-22 00:47:34,062 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 183 transitions. Word has length 22 [2020-10-22 00:47:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:34,062 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 183 transitions. [2020-10-22 00:47:34,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:47:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 183 transitions. [2020-10-22 00:47:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:34,063 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:34,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:34,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:47:34,064 INFO L429 AbstractCegarLoop]: === Iteration 13 === [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]=== [2020-10-22 00:47:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1157540390, now seen corresponding path program 5 times [2020-10-22 00:47:34,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:34,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514218364] [2020-10-22 00:47:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:34,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514218364] [2020-10-22 00:47:34,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:34,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-22 00:47:34,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556655463] [2020-10-22 00:47:34,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:34,682 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:34,691 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2020-10-22 00:47:34,691 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:34,728 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 00:47:34,739 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:34,743 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:34,746 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,749 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,752 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,755 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:34,773 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2020-10-22 00:47:34,773 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:144, output treesize:58 [2020-10-22 00:47:34,799 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:34,800 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,803 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:34,804 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,808 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:34,809 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,812 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:34,813 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:34,819 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,826 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:34,828 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:34,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:34,841 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:34,841 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:106, output treesize:40 [2020-10-22 00:47:35,005 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:35,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:47:35,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:47:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:47:35,007 INFO L87 Difference]: Start difference. First operand 113 states and 183 transitions. Second operand 11 states. [2020-10-22 00:47:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:35,563 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2020-10-22 00:47:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-22 00:47:35,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-22 00:47:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:35,565 INFO L225 Difference]: With dead ends: 140 [2020-10-22 00:47:35,565 INFO L226 Difference]: Without dead ends: 101 [2020-10-22 00:47:35,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-22 00:47:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-22 00:47:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-22 00:47:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-22 00:47:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2020-10-22 00:47:35,569 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 22 [2020-10-22 00:47:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:35,569 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-22 00:47:35,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:47:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2020-10-22 00:47:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:35,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:35,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:35,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:47:35,570 INFO L429 AbstractCegarLoop]: === Iteration 14 === [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]=== [2020-10-22 00:47:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 698584272, now seen corresponding path program 6 times [2020-10-22 00:47:35,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:35,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120222731] [2020-10-22 00:47:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:36,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120222731] [2020-10-22 00:47:36,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:36,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:36,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1688712827] [2020-10-22 00:47:36,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:36,214 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:36,220 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 34 transitions. [2020-10-22 00:47:36,221 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:36,355 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:36,355 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:36,360 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,365 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:36,366 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,370 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:36,370 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,374 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:36,375 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,379 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:36,380 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,393 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:36,394 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:36,394 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:106, output treesize:40 [2020-10-22 00:47:36,417 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 00:47:36,429 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:36,435 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,438 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,442 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,445 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:36,449 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:36,472 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:36,474 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2020-10-22 00:47:36,474 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:144, output treesize:58 [2020-10-22 00:47:36,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9583#(and (= ~my_dev~0.offset (+ |ULTIMATE.start_main_~#data~1.offset| 24)) (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork0_~data~0.base)) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) ~my_dev~0.offset))] [2020-10-22 00:47:36,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 00:47:36,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 00:47:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:47:36,476 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand 13 states. [2020-10-22 00:47:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:37,246 INFO L93 Difference]: Finished difference Result 131 states and 207 transitions. [2020-10-22 00:47:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-22 00:47:37,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-22 00:47:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:37,248 INFO L225 Difference]: With dead ends: 131 [2020-10-22 00:47:37,248 INFO L226 Difference]: Without dead ends: 101 [2020-10-22 00:47:37,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-10-22 00:47:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-22 00:47:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-22 00:47:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-22 00:47:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-10-22 00:47:37,254 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 22 [2020-10-22 00:47:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:37,254 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-22 00:47:37,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 00:47:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2020-10-22 00:47:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:37,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:37,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:37,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:47:37,256 INFO L429 AbstractCegarLoop]: === Iteration 15 === [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]=== [2020-10-22 00:47:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash -882544438, now seen corresponding path program 7 times [2020-10-22 00:47:37,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:37,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974875922] [2020-10-22 00:47:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:37,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974875922] [2020-10-22 00:47:37,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:37,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:37,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [41102581] [2020-10-22 00:47:37,974 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:37,979 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:37,988 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2020-10-22 00:47:37,988 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:38,087 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:47:38,098 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,101 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:38,102 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,116 INFO L625 ElimStorePlain]: treesize reduction 9, result has 73.5 percent of original size [2020-10-22 00:47:38,117 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-10-22 00:47:38,118 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:84, output treesize:25 [2020-10-22 00:47:38,666 WARN L193 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-22 00:47:38,677 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,678 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,684 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,684 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,690 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,690 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:38,721 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,724 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,726 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:38,740 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:38,740 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_121| vanished before elimination [2020-10-22 00:47:38,740 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-22 00:47:38,741 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:159, output treesize:36 [2020-10-22 00:47:38,953 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-10-22 00:47:38,963 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,963 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,972 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,972 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,979 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,980 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,987 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,988 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,994 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,994 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:38,999 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:38,999 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:39,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:39,050 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:39,050 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:39,058 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:39,059 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:39,063 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:39,064 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:39,070 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:39,070 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:39,076 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:39,076 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:39,086 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:39,087 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:39,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:39,103 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_122| vanished before elimination [2020-10-22 00:47:39,104 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_122| vanished before elimination [2020-10-22 00:47:39,104 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:39,104 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:289, output treesize:43 [2020-10-22 00:47:39,463 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:39,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:47:39,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:47:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:39,464 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand 12 states. [2020-10-22 00:47:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:40,123 INFO L93 Difference]: Finished difference Result 120 states and 184 transitions. [2020-10-22 00:47:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:47:40,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 00:47:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:40,125 INFO L225 Difference]: With dead ends: 120 [2020-10-22 00:47:40,125 INFO L226 Difference]: Without dead ends: 106 [2020-10-22 00:47:40,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:47:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-22 00:47:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2020-10-22 00:47:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-22 00:47:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2020-10-22 00:47:40,128 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 22 [2020-10-22 00:47:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:40,128 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2020-10-22 00:47:40,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:47:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2020-10-22 00:47:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:40,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:40,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:40,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 00:47:40,130 INFO L429 AbstractCegarLoop]: === Iteration 16 === [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]=== [2020-10-22 00:47:40,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:40,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1084936394, now seen corresponding path program 8 times [2020-10-22 00:47:40,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:40,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101613878] [2020-10-22 00:47:40,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:40,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101613878] [2020-10-22 00:47:40,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:40,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:40,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341445123] [2020-10-22 00:47:40,861 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:40,865 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:40,873 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-10-22 00:47:40,873 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:41,065 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 23 [2020-10-22 00:47:41,397 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 21 [2020-10-22 00:47:41,510 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 21 [2020-10-22 00:47:41,613 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10279#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.offset |ULTIMATE.start_main_~#data~1.offset|) (< 0 (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28))) (<= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork1_~data~0.base)))] [2020-10-22 00:47:41,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 00:47:41,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 00:47:41,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:47:41,614 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand 13 states. [2020-10-22 00:47:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:42,476 INFO L93 Difference]: Finished difference Result 128 states and 197 transitions. [2020-10-22 00:47:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-22 00:47:42,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-22 00:47:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:42,478 INFO L225 Difference]: With dead ends: 128 [2020-10-22 00:47:42,478 INFO L226 Difference]: Without dead ends: 100 [2020-10-22 00:47:42,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-10-22 00:47:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-10-22 00:47:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-10-22 00:47:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-22 00:47:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2020-10-22 00:47:42,482 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 22 [2020-10-22 00:47:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:42,482 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2020-10-22 00:47:42,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 00:47:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2020-10-22 00:47:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:42,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:42,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:42,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 00:47:42,483 INFO L429 AbstractCegarLoop]: === Iteration 17 === [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]=== [2020-10-22 00:47:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1122106956, now seen corresponding path program 9 times [2020-10-22 00:47:42,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:42,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6236728] [2020-10-22 00:47:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:43,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6236728] [2020-10-22 00:47:43,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:43,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:43,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975785813] [2020-10-22 00:47:43,115 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:43,120 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:43,129 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 46 transitions. [2020-10-22 00:47:43,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:43,137 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 00:47:43,147 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:43,150 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:43,155 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:43,157 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:43,159 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:43,162 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:43,179 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:43,181 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2020-10-22 00:47:43,181 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:144, output treesize:58 [2020-10-22 00:47:43,389 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 22 [2020-10-22 00:47:44,137 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-10-22 00:47:44,147 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,150 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,153 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,156 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,160 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,163 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:44,216 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-10-22 00:47:44,219 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,223 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,226 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,230 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,240 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,244 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:44,268 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:44,268 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-10-22 00:47:44,268 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:313, output treesize:67 [2020-10-22 00:47:44,298 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:44,299 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,303 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:44,303 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,334 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:44,339 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,342 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:44,343 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,346 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:44,347 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,352 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:44,352 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:44,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:44,363 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:44,363 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:106, output treesize:40 [2020-10-22 00:47:44,375 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:44,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:47:44,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:47:44,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:44,376 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand 12 states. [2020-10-22 00:47:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:45,038 INFO L93 Difference]: Finished difference Result 118 states and 181 transitions. [2020-10-22 00:47:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-22 00:47:45,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 00:47:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:45,040 INFO L225 Difference]: With dead ends: 118 [2020-10-22 00:47:45,040 INFO L226 Difference]: Without dead ends: 74 [2020-10-22 00:47:45,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-22 00:47:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-22 00:47:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-22 00:47:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-22 00:47:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2020-10-22 00:47:45,043 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 22 [2020-10-22 00:47:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:45,043 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2020-10-22 00:47:45,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:47:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2020-10-22 00:47:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:45,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:45,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:45,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 00:47:45,045 INFO L429 AbstractCegarLoop]: === Iteration 18 === [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]=== [2020-10-22 00:47:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 566019722, now seen corresponding path program 10 times [2020-10-22 00:47:45,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:45,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112250411] [2020-10-22 00:47:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:45,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112250411] [2020-10-22 00:47:45,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:45,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:45,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275772096] [2020-10-22 00:47:45,641 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:45,648 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:45,659 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-10-22 00:47:45,660 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:45,902 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-10-22 00:47:45,912 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:45,912 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,918 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:45,919 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,932 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:45,933 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,939 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:45,940 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,945 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:45,946 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,950 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:45,950 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:45,993 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,996 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:45,999 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,003 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,007 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,010 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:46,024 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:46,024 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_131| vanished before elimination [2020-10-22 00:47:46,025 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:46,025 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:289, output treesize:43 [2020-10-22 00:47:46,273 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 21 [2020-10-22 00:47:46,477 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-10-22 00:47:46,487 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,487 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,500 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,501 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,508 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,509 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,515 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,516 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,522 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,529 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,529 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,535 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,536 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,541 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,541 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:46,604 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,604 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,611 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,612 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,624 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,624 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,629 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,629 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,635 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,636 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,642 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,642 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,649 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,650 INFO L545 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,654 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:46,654 INFO L545 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:46,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:46,671 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_133| vanished before elimination [2020-10-22 00:47:46,671 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_133| vanished before elimination [2020-10-22 00:47:46,671 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-10-22 00:47:46,672 INFO L244 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:366, output treesize:38 [2020-10-22 00:47:46,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10904#(and (<= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1) (= |ULTIMATE.start_main_~#data~1.offset| 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork0_~data~0.base) (= |ULTIMATE.start_main_~#data~1.offset| my_callbackThread1of1ForFork0_~data~0.offset) (<= 1 (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28))) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork0_~data~0.base)))] [2020-10-22 00:47:46,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 00:47:46,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 00:47:46,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:47:46,726 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 13 states. [2020-10-22 00:47:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:47,582 INFO L93 Difference]: Finished difference Result 85 states and 119 transitions. [2020-10-22 00:47:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:47:47,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-22 00:47:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:47,584 INFO L225 Difference]: With dead ends: 85 [2020-10-22 00:47:47,584 INFO L226 Difference]: Without dead ends: 85 [2020-10-22 00:47:47,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2020-10-22 00:47:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-22 00:47:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2020-10-22 00:47:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-22 00:47:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2020-10-22 00:47:47,588 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 22 [2020-10-22 00:47:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:47,589 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2020-10-22 00:47:47,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 00:47:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2020-10-22 00:47:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:47,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:47,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:47,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-22 00:47:47,590 INFO L429 AbstractCegarLoop]: === Iteration 19 === [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]=== [2020-10-22 00:47:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash 566019706, now seen corresponding path program 4 times [2020-10-22 00:47:47,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:47,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123575225] [2020-10-22 00:47:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:47,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123575225] [2020-10-22 00:47:47,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:47,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:47:47,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341450418] [2020-10-22 00:47:47,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:47,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:47,850 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-10-22 00:47:47,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:48,016 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,016 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,021 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,022 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,027 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,028 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,034 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,034 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:48,065 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,065 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,069 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,070 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,074 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,075 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,080 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:48,080 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:48,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:48,088 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_134| vanished before elimination [2020-10-22 00:47:48,088 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_134| vanished before elimination [2020-10-22 00:47:48,089 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:48,089 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:179, output treesize:15 [2020-10-22 00:47:48,258 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:48,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:47:48,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:48,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:47:48,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:47:48,260 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand 8 states. [2020-10-22 00:47:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:48,485 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2020-10-22 00:47:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:47:48,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-22 00:47:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:48,487 INFO L225 Difference]: With dead ends: 101 [2020-10-22 00:47:48,487 INFO L226 Difference]: Without dead ends: 92 [2020-10-22 00:47:48,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:47:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-22 00:47:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-10-22 00:47:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-22 00:47:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2020-10-22 00:47:48,490 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 22 [2020-10-22 00:47:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:48,491 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2020-10-22 00:47:48,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:47:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2020-10-22 00:47:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:48,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:48,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:48,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-22 00:47:48,492 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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]=== [2020-10-22 00:47:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash -616705242, now seen corresponding path program 11 times [2020-10-22 00:47:48,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:48,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802632877] [2020-10-22 00:47:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:49,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802632877] [2020-10-22 00:47:49,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:49,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:49,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1757506831] [2020-10-22 00:47:49,101 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:49,105 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:49,116 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-10-22 00:47:49,116 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:49,439 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-10-22 00:47:49,454 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,458 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,461 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,464 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,469 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,471 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:49,544 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,547 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,549 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,551 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,554 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,557 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:49,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:49,571 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-10-22 00:47:49,571 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:49,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:49,572 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:289, output treesize:43 [2020-10-22 00:47:50,190 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-10-22 00:47:50,200 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,204 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,208 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,219 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,223 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,227 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,231 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:50,308 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,312 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,315 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,319 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,322 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,326 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,332 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:50,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:50,363 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-10-22 00:47:50,363 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:50,363 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-10-22 00:47:50,364 INFO L244 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:349, output treesize:62 [2020-10-22 00:47:50,619 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2020-10-22 00:47:50,653 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:50,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:47:50,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:47:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:50,655 INFO L87 Difference]: Start difference. First operand 85 states and 118 transitions. Second operand 12 states. [2020-10-22 00:47:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:51,407 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2020-10-22 00:47:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-22 00:47:51,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 00:47:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:51,409 INFO L225 Difference]: With dead ends: 91 [2020-10-22 00:47:51,409 INFO L226 Difference]: Without dead ends: 76 [2020-10-22 00:47:51,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:47:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-22 00:47:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-22 00:47:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-22 00:47:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2020-10-22 00:47:51,412 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 22 [2020-10-22 00:47:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:51,412 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2020-10-22 00:47:51,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:47:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2020-10-22 00:47:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:51,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:51,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:51,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-22 00:47:51,413 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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]=== [2020-10-22 00:47:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:51,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1024190236, now seen corresponding path program 5 times [2020-10-22 00:47:51,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:51,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396543005] [2020-10-22 00:47:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:51,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396543005] [2020-10-22 00:47:51,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:51,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:47:51,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431257922] [2020-10-22 00:47:51,668 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:51,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:51,684 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-10-22 00:47:51,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:51,764 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:51,765 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:51,768 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:51,769 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:51,773 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:51,774 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:51,779 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:51,780 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:51,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:51,788 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:47:51,788 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:60, output treesize:16 [2020-10-22 00:47:51,998 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11732#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| ~my_dev~0.base)) (= ~my_dev~0.offset 24) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|))] [2020-10-22 00:47:51,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:47:51,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:47:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:47:52,000 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand 9 states. [2020-10-22 00:47:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:52,298 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-10-22 00:47:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:47:52,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-22 00:47:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:52,300 INFO L225 Difference]: With dead ends: 75 [2020-10-22 00:47:52,300 INFO L226 Difference]: Without dead ends: 63 [2020-10-22 00:47:52,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:47:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-22 00:47:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2020-10-22 00:47:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-22 00:47:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2020-10-22 00:47:52,303 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 22 [2020-10-22 00:47:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:52,304 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2020-10-22 00:47:52,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:47:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2020-10-22 00:47:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:52,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:52,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:52,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-22 00:47:52,305 INFO L429 AbstractCegarLoop]: === Iteration 22 === [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]=== [2020-10-22 00:47:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash -304507168, now seen corresponding path program 12 times [2020-10-22 00:47:52,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:52,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717906632] [2020-10-22 00:47:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:52,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717906632] [2020-10-22 00:47:52,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:52,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:52,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415996740] [2020-10-22 00:47:52,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:52,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:52,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2020-10-22 00:47:52,967 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:52,979 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-10-22 00:47:53,578 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-10-22 00:47:53,591 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:53,592 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,613 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:53,613 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,620 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:53,621 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,628 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:53,628 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,635 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:53,635 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,642 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:53,642 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,648 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:53,649 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:53,711 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,714 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,722 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,725 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,728 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,732 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,735 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:53,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:53,760 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:47:53,761 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_143| vanished before elimination [2020-10-22 00:47:53,761 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-10-22 00:47:53,761 INFO L244 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:349, output treesize:62 [2020-10-22 00:47:53,939 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:53,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:47:53,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:47:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:53,941 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand 12 states. [2020-10-22 00:47:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:54,629 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2020-10-22 00:47:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-22 00:47:54,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 00:47:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:54,630 INFO L225 Difference]: With dead ends: 69 [2020-10-22 00:47:54,630 INFO L226 Difference]: Without dead ends: 53 [2020-10-22 00:47:54,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-22 00:47:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-22 00:47:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-22 00:47:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-22 00:47:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2020-10-22 00:47:54,633 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 22 [2020-10-22 00:47:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:54,633 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2020-10-22 00:47:54,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:47:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2020-10-22 00:47:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:54,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:54,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:54,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-22 00:47:54,634 INFO L429 AbstractCegarLoop]: === Iteration 23 === [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]=== [2020-10-22 00:47:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1003507688, now seen corresponding path program 13 times [2020-10-22 00:47:54,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:54,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864584693] [2020-10-22 00:47:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:55,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864584693] [2020-10-22 00:47:55,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:55,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:55,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870545546] [2020-10-22 00:47:55,253 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:55,258 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:55,264 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 30 transitions. [2020-10-22 00:47:55,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:55,523 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-10-22 00:47:55,538 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,539 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,548 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,548 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,555 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,555 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,562 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,562 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,577 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,577 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,585 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,585 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,592 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,592 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,598 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,598 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:55,661 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,662 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,668 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,668 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,674 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,675 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,681 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,681 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,690 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,697 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,697 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,705 INFO L545 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-22 00:47:55,710 INFO L545 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:55,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:55,729 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_145| vanished before elimination [2020-10-22 00:47:55,730 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_145| vanished before elimination [2020-10-22 00:47:55,730 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 8 xjuncts. [2020-10-22 00:47:55,730 INFO L244 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:366, output treesize:38 [2020-10-22 00:47:55,740 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12145#(and (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 ~my_dev~0.offset) (<= ~my_dev~0.offset 24) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 0) (= ~my_dev~0.base |ULTIMATE.start_main_~#data~1.base|))] [2020-10-22 00:47:55,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 00:47:55,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 00:47:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:47:55,742 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 13 states. [2020-10-22 00:47:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:56,492 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2020-10-22 00:47:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:47:56,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-22 00:47:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:56,493 INFO L225 Difference]: With dead ends: 68 [2020-10-22 00:47:56,493 INFO L226 Difference]: Without dead ends: 47 [2020-10-22 00:47:56,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-22 00:47:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-22 00:47:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-22 00:47:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-22 00:47:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-22 00:47:56,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 22 [2020-10-22 00:47:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:56,495 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-22 00:47:56,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 00:47:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-22 00:47:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:56,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:56,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:56,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-22 00:47:56,496 INFO L429 AbstractCegarLoop]: === Iteration 24 === [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]=== [2020-10-22 00:47:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1172676456, now seen corresponding path program 14 times [2020-10-22 00:47:56,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:56,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914750803] [2020-10-22 00:47:56,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:57,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914750803] [2020-10-22 00:47:57,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:57,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:57,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200561964] [2020-10-22 00:47:57,140 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:57,144 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:57,152 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 26 transitions. [2020-10-22 00:47:57,152 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:57,163 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 3 conjuncts [2020-10-22 00:47:57,166 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:57,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:47:57,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:57,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:47:57,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:57,167 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 12 states. [2020-10-22 00:47:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:57,718 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-10-22 00:47:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-22 00:47:57,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 00:47:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:57,719 INFO L225 Difference]: With dead ends: 53 [2020-10-22 00:47:57,719 INFO L226 Difference]: Without dead ends: 38 [2020-10-22 00:47:57,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:47:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-22 00:47:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-22 00:47:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-22 00:47:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2020-10-22 00:47:57,721 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2020-10-22 00:47:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:57,721 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2020-10-22 00:47:57,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:47:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2020-10-22 00:47:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:47:57,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:47:57,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:47:57,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-22 00:47:57,722 INFO L429 AbstractCegarLoop]: === Iteration 25 === [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]=== [2020-10-22 00:47:57,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:47:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash 552705304, now seen corresponding path program 15 times [2020-10-22 00:47:57,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:47:57,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992499890] [2020-10-22 00:47:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:47:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:47:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:47:58,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992499890] [2020-10-22 00:47:58,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:47:58,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:47:58,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178290183] [2020-10-22 00:47:58,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:47:58,408 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:47:58,414 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-10-22 00:47:58,414 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:47:58,424 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 3 conjuncts [2020-10-22 00:47:58,452 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:58,454 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,458 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:58,459 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,462 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:58,463 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,468 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:58,468 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,472 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:58,473 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,477 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2020-10-22 00:47:58,477 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:58,491 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:47:58,491 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:106, output treesize:40 [2020-10-22 00:47:58,512 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 00:47:58,517 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,520 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,524 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:58,527 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,530 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:47:58,534 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:47:58,553 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:47:58,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2020-10-22 00:47:58,555 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:144, output treesize:58 [2020-10-22 00:47:58,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:47:58,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:47:58,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:47:58,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:47:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:47:58,557 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 12 states. [2020-10-22 00:47:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:47:59,127 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-10-22 00:47:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-22 00:47:59,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-22 00:47:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:47:59,128 INFO L225 Difference]: With dead ends: 37 [2020-10-22 00:47:59,128 INFO L226 Difference]: Without dead ends: 0 [2020-10-22 00:47:59,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:47:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-22 00:47:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-22 00:47:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-22 00:47:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-22 00:47:59,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-22 00:47:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:47:59,129 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-22 00:47:59,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:47:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-22 00:47:59,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-22 00:47:59,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-22 00:47:59,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:47:59 BasicIcfg [2020-10-22 00:47:59,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:47:59,136 INFO L168 Benchmark]: Toolchain (without parser) took 52335.66 ms. Allocated memory was 141.0 MB in the beginning and 528.0 MB in the end (delta: 386.9 MB). Free memory was 100.3 MB in the beginning and 356.1 MB in the end (delta: -255.8 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:47:59,136 INFO L168 Benchmark]: CDTParser took 3.07 ms. Allocated memory is still 141.0 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 00:47:59,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1489.97 ms. Allocated memory was 141.0 MB in the beginning and 235.4 MB in the end (delta: 94.4 MB). Free memory was 99.3 MB in the beginning and 166.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:47:59,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.02 ms. Allocated memory is still 235.4 MB. Free memory was 166.7 MB in the beginning and 162.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:47:59,137 INFO L168 Benchmark]: Boogie Preprocessor took 48.57 ms. Allocated memory is still 235.4 MB. Free memory was 162.4 MB in the beginning and 159.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:47:59,137 INFO L168 Benchmark]: RCFGBuilder took 1022.84 ms. Allocated memory is still 235.4 MB. Free memory was 159.6 MB in the beginning and 107.6 MB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:47:59,138 INFO L168 Benchmark]: TraceAbstraction took 49632.75 ms. Allocated memory was 235.4 MB in the beginning and 528.0 MB in the end (delta: 292.6 MB). Free memory was 107.6 MB in the beginning and 356.1 MB in the end (delta: -248.5 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:47:59,140 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.07 ms. Allocated memory is still 141.0 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1489.97 ms. Allocated memory was 141.0 MB in the beginning and 235.4 MB in the end (delta: 94.4 MB). Free memory was 99.3 MB in the beginning and 166.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 130.02 ms. Allocated memory is still 235.4 MB. Free memory was 166.7 MB in the beginning and 162.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.57 ms. Allocated memory is still 235.4 MB. Free memory was 162.4 MB in the beginning and 159.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1022.84 ms. Allocated memory is still 235.4 MB. Free memory was 159.6 MB in the beginning and 107.6 MB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49632.75 ms. Allocated memory was 235.4 MB in the beginning and 528.0 MB in the end (delta: 292.6 MB). Free memory was 107.6 MB in the beginning and 356.1 MB in the end (delta: -248.5 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1757 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 89 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.9s, 178 PlacesBefore, 41 PlacesAfterwards, 188 TransitionsBefore, 40 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 9 FixpointIterations, 118 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 22 ConcurrentYvCompositions, 11 ChoiceCompositions, 229 TotalNumberOfCompositions, 8034 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 49.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 565 SDtfs, 678 SDslu, 1811 SDs, 0 SdLazy, 4582 SolverSat, 416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 135 SyntacticMatches, 66 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 309 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 458 ConstructedInterpolants, 0 QuantifiedInterpolants, 215163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...