/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:33:09,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:33:09,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:33:09,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:33:09,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:33:09,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:33:09,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:33:09,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:33:09,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:33:09,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:33:09,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:33:09,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:33:09,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:33:09,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:33:09,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:33:09,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:33:09,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:33:09,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:33:09,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:33:09,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:33:09,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:33:09,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:33:09,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:33:09,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:33:09,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:33:09,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:33:09,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:33:09,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:33:09,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:33:09,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:33:09,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:33:09,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:33:09,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:33:09,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:33:09,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:33:09,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:33:09,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:33:09,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:33:09,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:33:09,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:33:09,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:33:09,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 22:33:09,718 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:33:09,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:33:09,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:33:09,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:33:09,720 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:33:09,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:33:09,720 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:33:09,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:33:09,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:33:09,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:33:09,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:33:09,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:33:09,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:33:09,721 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:33:09,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:33:09,722 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:33:09,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:33:09,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:33:09,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:33:09,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:33:09,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:33:09,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:33:09,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:33:09,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:33:09,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:33:09,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:33:09,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:33:09,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:33:09,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:33:10,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:33:10,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:33:10,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:33:10,024 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:33:10,024 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:33:10,025 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-15 22:33:10,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f16ec58/fc34a9e9db3546f1ba4e257d2d157694/FLAGb4760703a [2020-10-15 22:33:10,692 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:33:10,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-15 22:33:10,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f16ec58/fc34a9e9db3546f1ba4e257d2d157694/FLAGb4760703a [2020-10-15 22:33:10,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f16ec58/fc34a9e9db3546f1ba4e257d2d157694 [2020-10-15 22:33:10,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:33:10,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:33:10,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:33:10,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:33:10,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:33:10,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:33:10" (1/1) ... [2020-10-15 22:33:10,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62fdc5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:10, skipping insertion in model container [2020-10-15 22:33:10,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:33:10" (1/1) ... [2020-10-15 22:33:10,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:33:11,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:33:11,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:33:11,904 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:33:11,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:33:12,398 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:33:12,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12 WrapperNode [2020-10-15 22:33:12,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:33:12,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:33:12,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:33:12,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:33:12,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:33:12,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:33:12,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:33:12,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:33:12,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (1/1) ... [2020-10-15 22:33:12,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:33:12,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:33:12,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:33:12,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:33:12,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (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-15 22:33:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:33:12,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 22:33:12,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-15 22:33:12,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:33:12,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:33:12,600 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-15 22:33:12,601 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-15 22:33:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:33:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:33:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-15 22:33:12,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-15 22:33:13,237 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:33:13,237 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-15 22:33:13,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:33:13 BoogieIcfgContainer [2020-10-15 22:33:13,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:33:13,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:33:13,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:33:13,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:33:13,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:33:10" (1/3) ... [2020-10-15 22:33:13,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fea8e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:33:13, skipping insertion in model container [2020-10-15 22:33:13,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:33:12" (2/3) ... [2020-10-15 22:33:13,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fea8e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:33:13, skipping insertion in model container [2020-10-15 22:33:13,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:33:13" (3/3) ... [2020-10-15 22:33:13,248 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-15 22:33:13,260 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:33:13,260 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:33:13,267 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-15 22:33:13,268 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:33:13,298 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,299 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,299 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,299 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,299 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,299 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,300 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,300 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,300 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,300 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,300 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,301 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,302 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,302 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,302 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,302 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,303 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,303 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,303 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,303 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,304 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,305 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,306 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,306 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,307 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,307 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,307 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,307 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,308 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,308 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,317 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,318 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,327 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,328 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,328 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,328 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,328 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,328 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,329 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,329 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,329 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:33:13,353 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-15 22:33:13,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:33:13,375 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:33:13,375 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:33:13,375 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:33:13,375 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:33:13,375 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:33:13,375 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:33:13,376 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:33:13,393 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:33:13,396 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-15 22:33:13,399 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-15 22:33:13,401 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-15 22:33:13,476 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-15 22:33:13,476 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-15 22:33:13,482 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-10-15 22:33:13,486 INFO L117 LiptonReduction]: Number of co-enabled transitions 1980 [2020-10-15 22:33:13,796 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-15 22:33:13,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,832 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-15 22:33:13,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,854 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-15 22:33:13,855 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:13,871 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-15 22:33:13,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,902 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-15 22:33:13,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:13,924 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-15 22:33:13,924 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:16,524 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-15 22:33:16,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:16,549 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-15 22:33:16,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:16,564 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-15 22:33:16,564 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-15 22:33:16,951 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-15 22:33:16,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:16,995 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-15 22:33:17,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:17,023 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-15 22:33:17,024 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:17,047 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-15 22:33:17,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:17,079 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-15 22:33:17,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:17,105 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-15 22:33:17,105 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 22:33:19,125 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-15 22:33:19,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:19,151 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-15 22:33:19,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:19,177 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-15 22:33:19,178 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:19,190 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-15 22:33:19,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:19,231 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-15 22:33:19,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:19,255 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-15 22:33:19,256 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:21,307 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-15 22:33:21,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:21,336 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-15 22:33:21,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:21,361 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-15 22:33:21,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:21,377 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-15 22:33:21,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:21,403 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-15 22:33:21,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:21,427 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-15 22:33:21,428 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:24,134 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-15 22:33:24,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:24,163 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-15 22:33:24,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:24,185 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-15 22:33:24,185 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 22:33:24,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-15 22:33:24,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:24,224 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-15 22:33:24,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:24,248 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-15 22:33:24,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 22:33:24,693 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-15 22:33:24,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:24,721 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-15 22:33:24,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:24,734 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-15 22:33:24,735 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-15 22:33:25,666 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-15 22:33:25,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,691 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-15 22:33:25,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,709 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-15 22:33:25,710 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-15 22:33:25,740 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-15 22:33:25,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,783 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-15 22:33:25,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,818 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-15 22:33:25,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-10-15 22:33:25,834 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-15 22:33:25,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,879 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-15 22:33:25,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:25,939 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-15 22:33:25,939 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2020-10-15 22:33:28,004 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-15 22:33:28,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:28,041 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-15 22:33:28,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:28,068 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-15 22:33:28,068 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-15 22:33:28,083 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-15 22:33:28,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:28,118 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-15 22:33:28,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:28,140 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-15 22:33:28,141 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 22:33:30,284 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-15 22:33:30,428 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-15 22:33:30,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:30,469 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-15 22:33:30,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:30,492 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-15 22:33:30,493 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-15 22:33:30,507 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-15 22:33:30,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:30,534 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-15 22:33:30,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:30,558 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-15 22:33:30,559 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 22:33:33,055 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-10-15 22:33:33,992 WARN L193 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-10-15 22:33:34,197 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-15 22:33:34,763 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-15 22:33:34,986 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 22:33:36,070 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-15 22:33:36,092 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-15 22:33:36,577 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-15 22:33:36,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:36,585 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-15 22:33:37,072 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 22:33:37,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 22:33:37,074 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-15 22:33:37,074 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-15 22:33:37,559 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 22:33:37,570 INFO L132 LiptonReduction]: Checked pairs total: 4147 [2020-10-15 22:33:37,571 INFO L134 LiptonReduction]: Total number of compositions: 165 [2020-10-15 22:33:37,578 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-10-15 22:33:37,597 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-10-15 22:33:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-10-15 22:33:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-15 22:33:37,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:37,607 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-15 22:33:37,607 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-15 22:33:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-10-15 22:33:37,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:37,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37547106] [2020-10-15 22:33:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:37,876 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-15 22:33:37,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37547106] [2020-10-15 22:33:37,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:37,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-15 22:33:37,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630220271] [2020-10-15 22:33:37,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-15 22:33:37,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:37,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-15 22:33:37,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 22:33:37,898 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-10-15 22:33:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:37,923 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-10-15 22:33:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-15 22:33:37,925 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-15 22:33:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:37,939 INFO L225 Difference]: With dead ends: 190 [2020-10-15 22:33:37,939 INFO L226 Difference]: Without dead ends: 172 [2020-10-15 22:33:37,941 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-15 22:33:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-15 22:33:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-10-15 22:33:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-15 22:33:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-10-15 22:33:38,002 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-10-15 22:33:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:38,002 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-10-15 22:33:38,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-15 22:33:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-10-15 22:33:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-15 22:33:38,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:38,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-15 22:33:38,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:33:38,004 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-15 22:33:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-10-15 22:33:38,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:38,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446000085] [2020-10-15 22:33:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:38,194 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-15 22:33:38,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446000085] [2020-10-15 22:33:38,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:38,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:33:38,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916006198] [2020-10-15 22:33:38,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:33:38,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:38,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:33:38,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:33:38,198 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-10-15 22:33:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:38,305 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-10-15 22:33:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:33:38,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-15 22:33:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:38,310 INFO L225 Difference]: With dead ends: 230 [2020-10-15 22:33:38,311 INFO L226 Difference]: Without dead ends: 230 [2020-10-15 22:33:38,311 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-15 22:33:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-15 22:33:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-15 22:33:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-15 22:33:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-15 22:33:38,337 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-15 22:33:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:38,337 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-15 22:33:38,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:33:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-15 22:33:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 22:33:38,338 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:38,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 22:33:38,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:33:38,339 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-15 22:33:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-10-15 22:33:38,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:38,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548118735] [2020-10-15 22:33:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:38,462 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-15 22:33:38,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548118735] [2020-10-15 22:33:38,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:38,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:33:38,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564003198] [2020-10-15 22:33:38,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:33:38,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:38,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:33:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:33:38,465 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-15 22:33:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:38,538 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-15 22:33:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:33:38,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 22:33:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:38,542 INFO L225 Difference]: With dead ends: 243 [2020-10-15 22:33:38,542 INFO L226 Difference]: Without dead ends: 236 [2020-10-15 22:33:38,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:33:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-15 22:33:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-15 22:33:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-15 22:33:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-15 22:33:38,560 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-15 22:33:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:38,560 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-15 22:33:38,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:33:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-15 22:33:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 22:33:38,562 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:38,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:38,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:33:38,562 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-15 22:33:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-10-15 22:33:38,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:38,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296915592] [2020-10-15 22:33:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:38,657 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-15 22:33:38,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296915592] [2020-10-15 22:33:38,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:38,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:33:38,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542910711] [2020-10-15 22:33:38,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:33:38,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:33:38,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:33:38,659 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-15 22:33:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:38,676 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-15 22:33:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:33:38,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 22:33:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:38,677 INFO L225 Difference]: With dead ends: 86 [2020-10-15 22:33:38,677 INFO L226 Difference]: Without dead ends: 86 [2020-10-15 22:33:38,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-15 22:33:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-15 22:33:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-15 22:33:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-15 22:33:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-15 22:33:38,690 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-15 22:33:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:38,690 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-15 22:33:38,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:33:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-15 22:33:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:38,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:38,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:38,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:33:38,695 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-15 22:33:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:38,696 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-10-15 22:33:38,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:38,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457088960] [2020-10-15 22:33:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:38,923 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-15 22:33:38,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457088960] [2020-10-15 22:33:38,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:38,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:33:38,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024018395] [2020-10-15 22:33:38,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:33:38,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:33:38,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:33:38,926 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-10-15 22:33:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:39,204 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-10-15 22:33:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:33:39,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-15 22:33:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:39,206 INFO L225 Difference]: With dead ends: 145 [2020-10-15 22:33:39,206 INFO L226 Difference]: Without dead ends: 145 [2020-10-15 22:33:39,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:33:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-15 22:33:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-10-15 22:33:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-15 22:33:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-10-15 22:33:39,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-10-15 22:33:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:39,213 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-10-15 22:33:39,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:33:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-10-15 22:33:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:39,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:39,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:39,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:33:39,215 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-15 22:33:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-10-15 22:33:39,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:39,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078202786] [2020-10-15 22:33:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:39,772 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-15 22:33:39,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078202786] [2020-10-15 22:33:39,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:39,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:33:39,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235417797] [2020-10-15 22:33:39,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:33:39,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:33:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:33:39,774 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-10-15 22:33:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:40,557 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-10-15 22:33:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:33:40,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 22:33:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:40,559 INFO L225 Difference]: With dead ends: 157 [2020-10-15 22:33:40,560 INFO L226 Difference]: Without dead ends: 136 [2020-10-15 22:33:40,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-15 22:33:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-15 22:33:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-10-15 22:33:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-15 22:33:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-10-15 22:33:40,566 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-10-15 22:33:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:40,566 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-10-15 22:33:40,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:33:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-10-15 22:33:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:40,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:40,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:40,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:33:40,568 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-15 22:33:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-10-15 22:33:40,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:40,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644056016] [2020-10-15 22:33:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:33:40,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644056016] [2020-10-15 22:33:40,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:40,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:33:40,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809601828] [2020-10-15 22:33:40,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:33:40,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:40,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:33:40,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:33:40,783 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 7 states. [2020-10-15 22:33:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:41,062 INFO L93 Difference]: Finished difference Result 158 states and 276 transitions. [2020-10-15 22:33:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:33:41,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-15 22:33:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:41,065 INFO L225 Difference]: With dead ends: 158 [2020-10-15 22:33:41,065 INFO L226 Difference]: Without dead ends: 158 [2020-10-15 22:33:41,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:33:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-15 22:33:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2020-10-15 22:33:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-15 22:33:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 200 transitions. [2020-10-15 22:33:41,071 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 200 transitions. Word has length 18 [2020-10-15 22:33:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:41,071 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 200 transitions. [2020-10-15 22:33:41,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:33:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 200 transitions. [2020-10-15 22:33:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:41,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:41,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:41,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:33:41,073 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-15 22:33:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-10-15 22:33:41,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:41,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423010131] [2020-10-15 22:33:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:41,571 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-15 22:33:41,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423010131] [2020-10-15 22:33:41,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:41,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:33:41,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803367237] [2020-10-15 22:33:41,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:33:41,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:33:41,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:33:41,577 INFO L87 Difference]: Start difference. First operand 109 states and 200 transitions. Second operand 12 states. [2020-10-15 22:33:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:42,307 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2020-10-15 22:33:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 22:33:42,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 22:33:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:42,309 INFO L225 Difference]: With dead ends: 137 [2020-10-15 22:33:42,310 INFO L226 Difference]: Without dead ends: 126 [2020-10-15 22:33:42,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-15 22:33:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-15 22:33:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-10-15 22:33:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-15 22:33:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 196 transitions. [2020-10-15 22:33:42,315 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 196 transitions. Word has length 18 [2020-10-15 22:33:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:42,316 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 196 transitions. [2020-10-15 22:33:42,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:33:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 196 transitions. [2020-10-15 22:33:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:42,317 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:42,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:42,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:33:42,317 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-15 22:33:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-10-15 22:33:42,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:42,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896183183] [2020-10-15 22:33:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:42,769 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-15 22:33:42,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896183183] [2020-10-15 22:33:42,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:42,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:33:42,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527369695] [2020-10-15 22:33:42,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:33:42,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:33:42,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:33:42,772 INFO L87 Difference]: Start difference. First operand 107 states and 196 transitions. Second operand 12 states. [2020-10-15 22:33:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:43,541 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2020-10-15 22:33:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 22:33:43,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 22:33:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:43,543 INFO L225 Difference]: With dead ends: 139 [2020-10-15 22:33:43,543 INFO L226 Difference]: Without dead ends: 124 [2020-10-15 22:33:43,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-15 22:33:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-15 22:33:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-10-15 22:33:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-15 22:33:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 192 transitions. [2020-10-15 22:33:43,547 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 192 transitions. Word has length 18 [2020-10-15 22:33:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:43,548 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 192 transitions. [2020-10-15 22:33:43,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:33:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 192 transitions. [2020-10-15 22:33:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:43,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:43,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:43,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:33:43,549 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-15 22:33:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1672062081, now seen corresponding path program 4 times [2020-10-15 22:33:43,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:43,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327721814] [2020-10-15 22:33:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:43,947 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-15 22:33:43,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327721814] [2020-10-15 22:33:43,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:43,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 22:33:43,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703135063] [2020-10-15 22:33:43,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 22:33:43,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 22:33:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:33:43,949 INFO L87 Difference]: Start difference. First operand 105 states and 192 transitions. Second operand 12 states. [2020-10-15 22:33:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:44,632 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-10-15 22:33:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:33:44,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-15 22:33:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:44,634 INFO L225 Difference]: With dead ends: 136 [2020-10-15 22:33:44,635 INFO L226 Difference]: Without dead ends: 113 [2020-10-15 22:33:44,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-15 22:33:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-15 22:33:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-10-15 22:33:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-15 22:33:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2020-10-15 22:33:44,640 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2020-10-15 22:33:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:44,640 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2020-10-15 22:33:44,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 22:33:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2020-10-15 22:33:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:44,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:44,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:44,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:33:44,641 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-15 22:33:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-10-15 22:33:44,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:44,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108732501] [2020-10-15 22:33:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:44,970 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-15 22:33:44,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108732501] [2020-10-15 22:33:44,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:44,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 22:33:44,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446136704] [2020-10-15 22:33:44,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 22:33:44,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:44,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 22:33:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:33:44,972 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2020-10-15 22:33:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:45,504 INFO L93 Difference]: Finished difference Result 153 states and 270 transitions. [2020-10-15 22:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:33:45,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-15 22:33:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:45,506 INFO L225 Difference]: With dead ends: 153 [2020-10-15 22:33:45,506 INFO L226 Difference]: Without dead ends: 132 [2020-10-15 22:33:45,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-15 22:33:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-15 22:33:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2020-10-15 22:33:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-15 22:33:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2020-10-15 22:33:45,511 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 18 [2020-10-15 22:33:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:45,512 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2020-10-15 22:33:45,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 22:33:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2020-10-15 22:33:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:45,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:45,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:45,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:33:45,513 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-15 22:33:45,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 3 times [2020-10-15 22:33:45,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:45,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374807673] [2020-10-15 22:33:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:33:45,688 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-15 22:33:45,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374807673] [2020-10-15 22:33:45,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:33:45,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 22:33:45,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340552370] [2020-10-15 22:33:45,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 22:33:45,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:33:45,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 22:33:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:33:45,690 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 9 states. [2020-10-15 22:33:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:33:46,160 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2020-10-15 22:33:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 22:33:46,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-15 22:33:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:33:46,163 INFO L225 Difference]: With dead ends: 229 [2020-10-15 22:33:46,163 INFO L226 Difference]: Without dead ends: 229 [2020-10-15 22:33:46,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-10-15 22:33:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-15 22:33:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 123. [2020-10-15 22:33:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-15 22:33:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 223 transitions. [2020-10-15 22:33:46,169 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 223 transitions. Word has length 18 [2020-10-15 22:33:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:33:46,169 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 223 transitions. [2020-10-15 22:33:46,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 22:33:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 223 transitions. [2020-10-15 22:33:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:33:46,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:33:46,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:33:46,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:33:46,170 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-15 22:33:46,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:33:46,171 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-10-15 22:33:46,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:33:46,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498672913] [2020-10-15 22:33:46,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:33:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:33:46,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:33:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:33:46,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:33:46,258 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:33:46,258 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:33:46,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:33:46,259 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 22:33:46,259 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 22:33:46,260 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 22:33:46,264 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse0 (select |#memory_int_In-2065440565| ULTIMATE.start_my_drv_probe_~data.base_In-2065440565))) (and (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-2065440565| (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-2065440565 28))) (= ULTIMATE.start_ldv_assert_~expression_Out-2065440565 1) (let ((.cse1 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-2065440565| 0))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-2065440565| 1) .cse1) (and (not .cse1) (= |ULTIMATE.start_ldv_assert_#in~expression_Out-2065440565| 0)))) (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-2065440565 24)) 0))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-2065440565, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-2065440565, #memory_int=|#memory_int_In-2065440565|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out-2065440565|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-2065440565|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-2065440565, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-2065440565, #memory_int=|#memory_int_In-2065440565|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-2065440565|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-2065440565} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-15 22:33:46,264 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In935959364| 2147483648)) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In935959364| 2147483647) (= ULTIMATE.start_ldv_assert_~expression_Out935959364 |ULTIMATE.start_ldv_assert_#in~expression_In935959364|) (not (= ULTIMATE.start_ldv_assert_~expression_Out935959364 0))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In935959364|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In935959364|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out935959364|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In935959364|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In935959364|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out935959364} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-15 22:33:46,271 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse1 (select |#memory_int_In-1812788220| |ULTIMATE.start_main_~#data~1.base_In-1812788220|))) (and (= ULTIMATE.start_ldv_assert_~expression_Out-1812788220 1) (let ((.cse0 (= |ULTIMATE.start_main_#t~mem43_Out-1812788220| 2))) (or (and .cse0 (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1812788220| 1)) (and (not .cse0) (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1812788220| 0)))) (= |ULTIMATE.start_main_#t~mem43_Out-1812788220| (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In-1812788220| 28))) (= (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In-1812788220| 24)) 1))) InVars {#memory_int=|#memory_int_In-1812788220|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In-1812788220|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In-1812788220|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out-1812788220|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out-1812788220|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out-1812788220|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out-1812788220|, #memory_int=|#memory_int_In-1812788220|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In-1812788220|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-1812788220|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In-1812788220|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1812788220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-15 22:33:46,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:33:46 BasicIcfg [2020-10-15 22:33:46,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:33:46,315 INFO L168 Benchmark]: Toolchain (without parser) took 35383.09 ms. Allocated memory was 250.6 MB in the beginning and 540.5 MB in the end (delta: 289.9 MB). Free memory was 204.0 MB in the beginning and 360.9 MB in the end (delta: -156.8 MB). Peak memory consumption was 133.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:33:46,316 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 250.6 MB. Free memory was 228.7 MB in the beginning and 227.8 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-15 22:33:46,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1466.72 ms. Allocated memory was 250.6 MB in the beginning and 354.4 MB in the end (delta: 103.8 MB). Free memory was 204.0 MB in the beginning and 316.3 MB in the end (delta: -112.3 MB). Peak memory consumption was 110.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:33:46,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.63 ms. Allocated memory is still 354.4 MB. Free memory was 316.3 MB in the beginning and 311.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:33:46,317 INFO L168 Benchmark]: Boogie Preprocessor took 48.88 ms. Allocated memory is still 354.4 MB. Free memory was 311.9 MB in the beginning and 309.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.2 GB. [2020-10-15 22:33:46,318 INFO L168 Benchmark]: RCFGBuilder took 701.06 ms. Allocated memory is still 354.4 MB. Free memory was 309.7 MB in the beginning and 262.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 14.2 GB. [2020-10-15 22:33:46,318 INFO L168 Benchmark]: TraceAbstraction took 33072.71 ms. Allocated memory was 354.4 MB in the beginning and 540.5 MB in the end (delta: 186.1 MB). Free memory was 260.5 MB in the beginning and 360.9 MB in the end (delta: -100.3 MB). Peak memory consumption was 85.8 MB. Max. memory is 14.2 GB. [2020-10-15 22:33:46,322 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 250.6 MB. Free memory was 228.7 MB in the beginning and 227.8 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1466.72 ms. Allocated memory was 250.6 MB in the beginning and 354.4 MB in the end (delta: 103.8 MB). Free memory was 204.0 MB in the beginning and 316.3 MB in the end (delta: -112.3 MB). Peak memory consumption was 110.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 87.63 ms. Allocated memory is still 354.4 MB. Free memory was 316.3 MB in the beginning and 311.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 48.88 ms. Allocated memory is still 354.4 MB. Free memory was 311.9 MB in the beginning and 309.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.2 GB. * RCFGBuilder took 701.06 ms. Allocated memory is still 354.4 MB. Free memory was 309.7 MB in the beginning and 262.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 33072.71 ms. Allocated memory was 354.4 MB in the beginning and 540.5 MB in the end (delta: 186.1 MB). Free memory was 260.5 MB in the beginning and 360.9 MB in the end (delta: -100.3 MB). Peak memory consumption was 85.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1328 VarBasedMoverChecksPositive, 53 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 15.8s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 24.1s, 144 PlacesBefore, 36 PlacesAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 7 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 165 TotalNumberOfCompositions, 4147 MoverChecksTotal - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1695] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1700] 1 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 24.2s, HoareTripleCheckerStatistics: 284 SDtfs, 364 SDslu, 920 SDs, 0 SdLazy, 2258 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 356 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 48623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...