/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:24:46,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:24:46,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:24:46,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:24:46,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:24:46,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:24:46,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:24:46,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:24:46,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:24:46,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:24:46,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:24:46,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:24:46,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:24:46,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:24:46,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:24:46,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:24:46,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:24:46,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:24:46,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:24:46,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:24:46,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:24:46,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:24:46,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:24:46,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:24:46,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:24:46,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:24:46,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:24:46,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:24:46,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:24:46,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:24:46,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:24:46,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:24:46,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:24:46,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:24:46,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:24:46,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:24:46,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:24:46,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:24:46,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:24:46,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:24:46,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:24:46,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:24:46,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:24:46,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:24:46,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:24:46,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:24:46,453 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:24:46,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:24:46,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:24:46,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:24:46,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:24:46,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:24:46,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:24:46,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:24:46,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:24:46,456 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:24:46,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:24:46,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:24:46,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:24:46,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:24:46,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:24:46,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:24:46,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:24:46,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:24:46,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:24:46,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:24:46,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:24:46,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:24:46,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:24:46,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:24:46,459 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:24:46,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:24:46,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:24:46,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:24:46,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:24:46,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:24:46,784 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:24:46,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2019-12-27 00:24:46,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e84224c2/7d9394e17f6e45b6a2bd7a28b20c9605/FLAG71050d993 [2019-12-27 00:24:47,435 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:24:47,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2019-12-27 00:24:47,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e84224c2/7d9394e17f6e45b6a2bd7a28b20c9605/FLAG71050d993 [2019-12-27 00:24:47,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e84224c2/7d9394e17f6e45b6a2bd7a28b20c9605 [2019-12-27 00:24:47,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:24:47,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:24:47,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:24:47,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:24:47,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:24:47,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:24:47" (1/1) ... [2019-12-27 00:24:47,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c507e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:47, skipping insertion in model container [2019-12-27 00:24:47,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:24:47" (1/1) ... [2019-12-27 00:24:47,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:24:47,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:24:48,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:24:48,629 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:24:48,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:24:49,150 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:24:49,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49 WrapperNode [2019-12-27 00:24:49,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:24:49,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:24:49,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:24:49,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:24:49,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:24:49,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:24:49,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:24:49,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:24:49,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... [2019-12-27 00:24:49,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:24:49,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:24:49,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:24:49,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:24:49,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:24:49,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:24:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:24:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 00:24:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:24:49,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:24:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 00:24:49,430 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 00:24:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:24:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:24:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 00:24:49,434 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:24:50,185 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:24:50,185 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 00:24:50,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:24:50 BoogieIcfgContainer [2019-12-27 00:24:50,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:24:50,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:24:50,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:24:50,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:24:50,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:24:47" (1/3) ... [2019-12-27 00:24:50,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd0554d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:24:50, skipping insertion in model container [2019-12-27 00:24:50,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:49" (2/3) ... [2019-12-27 00:24:50,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd0554d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:24:50, skipping insertion in model container [2019-12-27 00:24:50,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:24:50" (3/3) ... [2019-12-27 00:24:50,196 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2019-12-27 00:24:50,205 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:24:50,206 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:24:50,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 00:24:50,215 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:24:50,249 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,249 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,249 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,250 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,250 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,250 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,250 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,251 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,251 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,251 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,251 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,251 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,252 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,252 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,252 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,252 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,253 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,253 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,253 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,253 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,254 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,254 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,254 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,255 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,255 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,258 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,258 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,258 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,258 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,259 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,259 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,260 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,260 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,264 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,264 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,264 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,264 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,265 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,265 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,265 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,265 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,266 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,273 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,273 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,273 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,273 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,274 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,274 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,274 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,274 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,275 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:50,307 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 00:24:50,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:24:50,326 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:24:50,327 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:24:50,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:24:50,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:24:50,327 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:24:50,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:24:50,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:24:50,346 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions [2019-12-27 00:24:50,349 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions [2019-12-27 00:24:50,440 INFO L132 PetriNetUnfolder]: 11/186 cut-off events. [2019-12-27 00:24:50,440 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:24:50,452 INFO L76 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/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2019-12-27 00:24:50,459 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions [2019-12-27 00:24:50,570 INFO L132 PetriNetUnfolder]: 11/186 cut-off events. [2019-12-27 00:24:50,570 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:24:50,574 INFO L76 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/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2019-12-27 00:24:50,581 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2019-12-27 00:24:50,583 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:24:51,036 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:51,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:51,086 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:51,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:51,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:51,125 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:51,143 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:51,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:51,187 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:51,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:51,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:51,221 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:54,276 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:54,312 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:54,333 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,333 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-27 00:24:54,987 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:55,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:55,034 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:55,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:55,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:55,070 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:24:55,101 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:55,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:55,152 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:55,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:55,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:55,210 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:24:57,236 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:57,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:57,283 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:57,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:57,319 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:57,319 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:57,336 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:57,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:57,369 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:57,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:57,396 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:57,397 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:59,418 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,453 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,482 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:59,495 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,530 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,560 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,561 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:25:03,517 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:03,552 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:03,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,574 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-27 00:25:04,376 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 00:25:04,705 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-12-27 00:25:05,100 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:05,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:05,161 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:05,208 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:05,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:05,210 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2019-12-27 00:25:05,223 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:05,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:05,285 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:05,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:05,333 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:05,333 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2019-12-27 00:25:07,363 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:07,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:07,413 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:07,452 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:07,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:07,454 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2019-12-27 00:25:07,467 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:07,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:07,516 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:07,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:07,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:07,554 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 00:25:09,624 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:09,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:09,662 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:09,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:09,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:09,689 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2019-12-27 00:25:10,715 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-12-27 00:25:10,838 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-27 00:25:11,267 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-12-27 00:25:12,129 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2019-12-27 00:25:12,393 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-12-27 00:25:13,900 WARN L192 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2019-12-27 00:25:13,920 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:14,387 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 00:25:14,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:14,397 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:14,987 WARN L192 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 00:25:14,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:14,988 INFO L534 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. [2019-12-27 00:25:14,988 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-27 00:25:15,562 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 00:25:16,237 WARN L192 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-27 00:25:16,581 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 00:25:16,589 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3024 [2019-12-27 00:25:16,589 INFO L214 etLargeBlockEncoding]: Total number of compositions: 157 [2019-12-27 00:25:16,592 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 35 transitions [2019-12-27 00:25:16,611 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 209 states. [2019-12-27 00:25:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-12-27 00:25:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 00:25:16,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:16,620 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 00:25:16,620 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash 537, now seen corresponding path program 1 times [2019-12-27 00:25:16,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:16,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161838544] [2019-12-27 00:25:16,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:16,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161838544] [2019-12-27 00:25:16,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:16,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 00:25:16,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442591142] [2019-12-27 00:25:16,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 00:25:16,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 00:25:16,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 00:25:16,928 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 2 states. [2019-12-27 00:25:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:16,954 INFO L93 Difference]: Finished difference Result 207 states and 457 transitions. [2019-12-27 00:25:16,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 00:25:16,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 00:25:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:16,970 INFO L225 Difference]: With dead ends: 207 [2019-12-27 00:25:16,970 INFO L226 Difference]: Without dead ends: 172 [2019-12-27 00:25:16,971 INFO L631 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 [2019-12-27 00:25:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-27 00:25:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-12-27 00:25:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-12-27 00:25:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2019-12-27 00:25:17,023 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2019-12-27 00:25:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:17,023 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2019-12-27 00:25:17,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 00:25:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2019-12-27 00:25:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:25:17,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:17,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:25:17,024 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2019-12-27 00:25:17,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:17,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848175295] [2019-12-27 00:25:17,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:17,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848175295] [2019-12-27 00:25:17,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:17,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:25:17,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328609920] [2019-12-27 00:25:17,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:25:17,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:25:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:17,242 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2019-12-27 00:25:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:17,411 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2019-12-27 00:25:17,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:25:17,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 00:25:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:17,417 INFO L225 Difference]: With dead ends: 230 [2019-12-27 00:25:17,417 INFO L226 Difference]: Without dead ends: 230 [2019-12-27 00:25:17,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-27 00:25:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2019-12-27 00:25:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-27 00:25:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2019-12-27 00:25:17,460 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2019-12-27 00:25:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:17,461 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2019-12-27 00:25:17,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:25:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2019-12-27 00:25:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:25:17,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:17,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:25:17,463 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 514428409, now seen corresponding path program 1 times [2019-12-27 00:25:17,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:17,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566904364] [2019-12-27 00:25:17,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:17,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566904364] [2019-12-27 00:25:17,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:17,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:25:17,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790933544] [2019-12-27 00:25:17,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:25:17,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:25:17,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:17,563 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2019-12-27 00:25:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:17,694 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2019-12-27 00:25:17,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:25:17,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 00:25:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:17,697 INFO L225 Difference]: With dead ends: 243 [2019-12-27 00:25:17,697 INFO L226 Difference]: Without dead ends: 236 [2019-12-27 00:25:17,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-27 00:25:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2019-12-27 00:25:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 00:25:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2019-12-27 00:25:17,714 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2019-12-27 00:25:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:17,714 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2019-12-27 00:25:17,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:25:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2019-12-27 00:25:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:25:17,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:17,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:17,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2130966860, now seen corresponding path program 1 times [2019-12-27 00:25:17,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:17,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193075513] [2019-12-27 00:25:17,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:17,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193075513] [2019-12-27 00:25:17,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:17,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:25:17,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210125320] [2019-12-27 00:25:17,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:25:17,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:17,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:25:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:17,791 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2019-12-27 00:25:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:17,809 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2019-12-27 00:25:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:25:17,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 00:25:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:17,810 INFO L225 Difference]: With dead ends: 86 [2019-12-27 00:25:17,811 INFO L226 Difference]: Without dead ends: 86 [2019-12-27 00:25:17,811 INFO L631 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 [2019-12-27 00:25:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-27 00:25:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-27 00:25:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 00:25:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2019-12-27 00:25:17,815 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2019-12-27 00:25:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:17,815 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2019-12-27 00:25:17,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:25:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2019-12-27 00:25:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:17,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:17,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:17,817 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash -321590399, now seen corresponding path program 1 times [2019-12-27 00:25:17,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:17,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418827764] [2019-12-27 00:25:17,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:18,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418827764] [2019-12-27 00:25:18,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:18,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:25:18,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476235509] [2019-12-27 00:25:18,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:25:18,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:25:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:25:18,318 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2019-12-27 00:25:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:18,806 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2019-12-27 00:25:18,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:25:18,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 00:25:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:18,807 INFO L225 Difference]: With dead ends: 148 [2019-12-27 00:25:18,807 INFO L226 Difference]: Without dead ends: 148 [2019-12-27 00:25:18,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:25:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-27 00:25:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2019-12-27 00:25:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-27 00:25:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 201 transitions. [2019-12-27 00:25:18,812 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 201 transitions. Word has length 18 [2019-12-27 00:25:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:18,812 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 201 transitions. [2019-12-27 00:25:18,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:25:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 201 transitions. [2019-12-27 00:25:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:18,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:18,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:18,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash -321590379, now seen corresponding path program 1 times [2019-12-27 00:25:18,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:18,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508940543] [2019-12-27 00:25:18,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:19,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508940543] [2019-12-27 00:25:19,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:19,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:25:19,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849688392] [2019-12-27 00:25:19,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:25:19,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:19,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:25:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:25:19,773 INFO L87 Difference]: Start difference. First operand 109 states and 201 transitions. Second operand 12 states. [2019-12-27 00:25:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:20,907 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2019-12-27 00:25:20,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:25:20,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 00:25:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:20,909 INFO L225 Difference]: With dead ends: 149 [2019-12-27 00:25:20,909 INFO L226 Difference]: Without dead ends: 138 [2019-12-27 00:25:20,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-27 00:25:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2019-12-27 00:25:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-27 00:25:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 197 transitions. [2019-12-27 00:25:20,914 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 197 transitions. Word has length 18 [2019-12-27 00:25:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:20,914 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 197 transitions. [2019-12-27 00:25:20,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:25:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 197 transitions. [2019-12-27 00:25:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:20,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:20,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:20,916 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash -235778121, now seen corresponding path program 2 times [2019-12-27 00:25:20,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:20,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417447438] [2019-12-27 00:25:20,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:21,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417447438] [2019-12-27 00:25:21,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:21,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:25:21,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149624954] [2019-12-27 00:25:21,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:25:21,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:25:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:25:21,857 INFO L87 Difference]: Start difference. First operand 107 states and 197 transitions. Second operand 12 states. [2019-12-27 00:25:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:23,027 INFO L93 Difference]: Finished difference Result 151 states and 257 transitions. [2019-12-27 00:25:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:25:23,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 00:25:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:23,029 INFO L225 Difference]: With dead ends: 151 [2019-12-27 00:25:23,029 INFO L226 Difference]: Without dead ends: 136 [2019-12-27 00:25:23,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-27 00:25:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2019-12-27 00:25:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-27 00:25:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 193 transitions. [2019-12-27 00:25:23,033 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 193 transitions. Word has length 18 [2019-12-27 00:25:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:23,034 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 193 transitions. [2019-12-27 00:25:23,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:25:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 193 transitions. [2019-12-27 00:25:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:23,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:23,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:23,035 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash 794008717, now seen corresponding path program 3 times [2019-12-27 00:25:23,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:23,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792067321] [2019-12-27 00:25:23,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:23,437 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-12-27 00:25:23,563 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-12-27 00:25:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:24,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792067321] [2019-12-27 00:25:24,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:24,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:25:24,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198800782] [2019-12-27 00:25:24,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:25:24,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:25:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:25:24,087 INFO L87 Difference]: Start difference. First operand 105 states and 193 transitions. Second operand 12 states. [2019-12-27 00:25:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:25,053 INFO L93 Difference]: Finished difference Result 123 states and 220 transitions. [2019-12-27 00:25:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:25:25,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 00:25:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:25,055 INFO L225 Difference]: With dead ends: 123 [2019-12-27 00:25:25,055 INFO L226 Difference]: Without dead ends: 104 [2019-12-27 00:25:25,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-27 00:25:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2019-12-27 00:25:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 00:25:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2019-12-27 00:25:25,059 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 18 [2019-12-27 00:25:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:25,060 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2019-12-27 00:25:25,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:25:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2019-12-27 00:25:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:25,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:25,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:25,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1224207459, now seen corresponding path program 2 times [2019-12-27 00:25:25,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:25,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075574651] [2019-12-27 00:25:25,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:25,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075574651] [2019-12-27 00:25:25,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:25,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:25:25,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081459887] [2019-12-27 00:25:25,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:25:25,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:25:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:25:25,456 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand 7 states. [2019-12-27 00:25:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:25,886 INFO L93 Difference]: Finished difference Result 133 states and 244 transitions. [2019-12-27 00:25:25,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:25:25,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 00:25:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:25,887 INFO L225 Difference]: With dead ends: 133 [2019-12-27 00:25:25,887 INFO L226 Difference]: Without dead ends: 133 [2019-12-27 00:25:25,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:25:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-27 00:25:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 103. [2019-12-27 00:25:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-27 00:25:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 189 transitions. [2019-12-27 00:25:25,891 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 189 transitions. Word has length 18 [2019-12-27 00:25:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:25,892 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 189 transitions. [2019-12-27 00:25:25,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:25:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2019-12-27 00:25:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:25,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:25,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:25,893 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1224207479, now seen corresponding path program 4 times [2019-12-27 00:25:25,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:25,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976519654] [2019-12-27 00:25:25,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:26,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976519654] [2019-12-27 00:25:26,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:26,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:25:26,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898198206] [2019-12-27 00:25:26,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:25:26,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:25:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:25:26,684 INFO L87 Difference]: Start difference. First operand 103 states and 189 transitions. Second operand 12 states. [2019-12-27 00:25:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:27,765 INFO L93 Difference]: Finished difference Result 157 states and 264 transitions. [2019-12-27 00:25:27,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:25:27,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 00:25:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:27,767 INFO L225 Difference]: With dead ends: 157 [2019-12-27 00:25:27,767 INFO L226 Difference]: Without dead ends: 132 [2019-12-27 00:25:27,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:25:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-27 00:25:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2019-12-27 00:25:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-27 00:25:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2019-12-27 00:25:27,771 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2019-12-27 00:25:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:27,772 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2019-12-27 00:25:27,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:25:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2019-12-27 00:25:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:27,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:27,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:27,773 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1118582541, now seen corresponding path program 3 times [2019-12-27 00:25:27,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:27,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678474754] [2019-12-27 00:25:27,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:28,213 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-12-27 00:25:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:28,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678474754] [2019-12-27 00:25:28,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:28,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:25:28,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212255068] [2019-12-27 00:25:28,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:25:28,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:25:28,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:25:28,553 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 9 states. [2019-12-27 00:25:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:29,260 INFO L93 Difference]: Finished difference Result 172 states and 291 transitions. [2019-12-27 00:25:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:25:29,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-12-27 00:25:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:29,263 INFO L225 Difference]: With dead ends: 172 [2019-12-27 00:25:29,263 INFO L226 Difference]: Without dead ends: 172 [2019-12-27 00:25:29,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:25:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-27 00:25:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 119. [2019-12-27 00:25:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-27 00:25:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 218 transitions. [2019-12-27 00:25:29,268 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 218 transitions. Word has length 18 [2019-12-27 00:25:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:29,269 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 218 transitions. [2019-12-27 00:25:29,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:25:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 218 transitions. [2019-12-27 00:25:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:25:29,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:29,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:29,270 INFO L410 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]=== [2019-12-27 00:25:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1118582561, now seen corresponding path program 5 times [2019-12-27 00:25:29,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:29,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275599714] [2019-12-27 00:25:29,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:25:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:25:29,360 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:25:29,360 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:25:29,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [511] [511] ULTIMATE.startENTRY-->L1713-1: Formula: (let ((.cse1 (store |v_#valid_109| 0 0))) (let ((.cse0 (store .cse1 |v_~#t1~0.base_29| 1))) (let ((.cse4 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_32 28)) (.cse5 (store .cse0 |v_~#t2~0.base_36| 1)) (.cse3 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_32 24))) (and (= v_~my_dev~0.base_34 v_ULTIMATE.start_my_drv_probe_~data.base_32) (= |v_#NULL.base_11| 0) (= 0 (select (select |v_#memory_int_318| |v_~#t1~0.base_29|) |v_~#t1~0.offset_29|)) (= 0 (select (select |v_#memory_int_318| |v_~#t2~0.base_36|) |v_~#t2~0.offset_36|)) (= |v_#length_68| (store (store (store |v_#length_69| |v_~#t1~0.base_29| 4) |v_~#t2~0.base_36| 4) |v_ULTIMATE.start_main_~#data~1.base_135| 32)) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| v_ULTIMATE.start_my_drv_probe_~data.base_32) (= 0 (select .cse0 |v_~#t2~0.base_36|)) (< 0 |v_#StackHeapBarrier_34|) (= (select .cse1 |v_~#t1~0.base_29|) 0) (= v_ULTIMATE.start_my_drv_probe_~res~0_21 0) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_15| |v_ULTIMATE.start_main_~#data~1.offset_130|) (< |v_#StackHeapBarrier_34| |v_~#t2~0.base_36|) (= v_ULTIMATE.start_ldv_assert_~expression_118 |v_ULTIMATE.start_ldv_assert_#in~expression_100|) (= 0 v_ULTIMATE.start_main_~ret~0_24) (= |v_#memory_$Pointer$.base_265| (let ((.cse2 (store |v_#memory_$Pointer$.base_267| v_ULTIMATE.start_my_drv_probe_~data.base_32 (store (store (select |v_#memory_$Pointer$.base_267| v_ULTIMATE.start_my_drv_probe_~data.base_32) .cse3 v_DerPreprocessor_55) .cse4 v_DerPreprocessor_57)))) (store .cse2 |v_~#t1~0.base_29| (store (select .cse2 |v_~#t1~0.base_29|) |v_~#t1~0.offset_29| (select (select |v_#memory_$Pointer$.base_265| |v_~#t1~0.base_29|) |v_~#t1~0.offset_29|))))) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#data~1.base_135|)) (= |v_#memory_int_316| (let ((.cse6 (store |v_#memory_int_318| v_ULTIMATE.start_my_drv_probe_~data.base_32 (store (store (select |v_#memory_int_318| v_ULTIMATE.start_my_drv_probe_~data.base_32) .cse3 0) .cse4 0)))) (store .cse6 |v_~#t1~0.base_29| (store (select .cse6 |v_~#t1~0.base_29|) |v_~#t1~0.offset_29| 0)))) (= |v_~#t2~0.offset_36| 0) (= |v_#memory_$Pointer$.offset_265| (let ((.cse7 (store |v_#memory_$Pointer$.offset_267| v_ULTIMATE.start_my_drv_probe_~data.base_32 (store (store (select |v_#memory_$Pointer$.offset_267| v_ULTIMATE.start_my_drv_probe_~data.base_32) .cse3 v_DerPreprocessor_56) .cse4 v_DerPreprocessor_58)))) (store .cse7 |v_~#t1~0.base_29| (store (select .cse7 |v_~#t1~0.base_29|) |v_~#t1~0.offset_29| (select (select |v_#memory_$Pointer$.offset_265| |v_~#t1~0.base_29|) |v_~#t1~0.offset_29|))))) (= |v_#pthreadsMutex_20| (store |v_#pthreadsMutex_21| v_ULTIMATE.start_my_drv_probe_~data.base_32 (store (select |v_#pthreadsMutex_21| v_ULTIMATE.start_my_drv_probe_~data.base_32) v_ULTIMATE.start_my_drv_probe_~data.offset_32 0))) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_15| v_ULTIMATE.start_my_drv_probe_~data.offset_32) (= 0 |v_ULTIMATE.start_main_~#data~1.offset_130|) (= 1 |v_ULTIMATE.start_ldv_assert_#in~expression_100|) (= (store .cse5 |v_ULTIMATE.start_main_~#data~1.base_135| 1) |v_#valid_108|) (< |v_#StackHeapBarrier_34| |v_~#t1~0.base_29|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_main_~#data~1.base_135|) (= 0 |v_#NULL.offset_11|) (= |v_~#t1~0.offset_29| 0) (= v_~my_dev~0.offset_34 .cse3) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| |v_ULTIMATE.start_main_~#data~1.base_135|) (= 0 |v_ULTIMATE.start_my_drv_init_#res_15|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_21|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_267|, #valid=|v_#valid_109|, #memory_int=|v_#memory_int_318|, #length=|v_#length_69|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_267|} OutVars{ULTIMATE.start_main_#t~mem45=|v_ULTIMATE.start_main_#t~mem45_41|, ULTIMATE.start_main_#t~mem43=|v_ULTIMATE.start_main_#t~mem43_30|, ULTIMATE.start_main_#t~mem44=|v_ULTIMATE.start_main_#t~mem44_41|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_265|, ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_21|, ULTIMATE.start_main_#t~mem42=|v_ULTIMATE.start_main_#t~mem42_32|, #NULL.offset=|v_#NULL.offset_11|, ~#t1~0.offset=|v_~#t1~0.offset_29|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_118, ~#t1~0.base=|v_~#t1~0.base_29|, ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_32, ULTIMATE.start_my_drv_init_#res=|v_ULTIMATE.start_my_drv_init_#res_15|, ~#t2~0.offset=|v_~#t2~0.offset_36|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_130|, #length=|v_#length_68|, ~my_dev~0.offset=v_~my_dev~0.offset_34, ~#t2~0.base=|v_~#t2~0.base_36|, #pthreadsMutex=|v_#pthreadsMutex_20|, ULTIMATE.start_my_drv_probe_#in~data.base=|v_ULTIMATE.start_my_drv_probe_#in~data.base_15|, ULTIMATE.start_main_~ret~0=v_ULTIMATE.start_main_~ret~0_24, ULTIMATE.start_main_#t~ret40=|v_ULTIMATE.start_main_#t~ret40_28|, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_32, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_46|, ~my_dev~0.base=v_~my_dev~0.base_34, ULTIMATE.start_my_drv_probe_#in~data.offset=|v_ULTIMATE.start_my_drv_probe_#in~data.offset_15|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_24|, ULTIMATE.start_my_drv_probe_~res~0=v_ULTIMATE.start_my_drv_probe_~res~0_21, ULTIMATE.start_my_drv_probe_#t~nondet35=|v_ULTIMATE.start_my_drv_probe_#t~nondet35_13|, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_11|, ULTIMATE.start_ldv_assert_#in~expression=|v_ULTIMATE.start_ldv_assert_#in~expression_100|, #NULL.base=|v_#NULL.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ULTIMATE.start_my_drv_probe_#t~mem31=|v_ULTIMATE.start_my_drv_probe_#t~mem31_25|, ULTIMATE.start_my_drv_probe_#t~mem32=|v_ULTIMATE.start_my_drv_probe_#t~mem32_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_316|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_48, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_135|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_265|} AuxVars[v_DerPreprocessor_57, v_DerPreprocessor_58, v_DerPreprocessor_55, v_DerPreprocessor_56] AssignedVars[ULTIMATE.start_main_#t~mem45, ULTIMATE.start_main_#t~mem43, ULTIMATE.start_main_#t~mem44, #memory_$Pointer$.base, ULTIMATE.start_my_drv_probe_#res, ULTIMATE.start_main_#t~mem42, #NULL.offset, ~#t1~0.offset, ULTIMATE.start_ldv_assert_~expression, ~#t1~0.base, ULTIMATE.start_my_drv_probe_~data.base, ULTIMATE.start_my_drv_init_#res, ~#t2~0.offset, ULTIMATE.start_main_~#data~1.offset, #length, ~my_dev~0.offset, ~#t2~0.base, #pthreadsMutex, ULTIMATE.start_my_drv_probe_#in~data.base, ULTIMATE.start_main_~ret~0, ULTIMATE.start_main_#t~ret40, ULTIMATE.start_my_drv_probe_~data.offset, ULTIMATE.start_main_#t~ret41, ~my_dev~0.base, ULTIMATE.start_my_drv_probe_#in~data.offset, ULTIMATE.start_my_drv_probe_#t~nondet33, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_my_drv_probe_#t~nondet35, ULTIMATE.start_my_drv_probe_#t~nondet34, ULTIMATE.start_ldv_assert_#in~expression, #NULL.base, ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_main_~#data~1.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:29,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [468] [468] my_callbackENTRY-->L1699-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_53 24))) (and (= |v_#memory_$Pointer$.base_161| (store |v_#memory_$Pointer$.base_162| v_my_callbackThread1of1ForFork0_~data~0.base_53 (store (select |v_#memory_$Pointer$.base_162| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0 (select (select |v_#memory_$Pointer$.base_161| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0)))) (= v_my_callbackThread1of1ForFork0_~data~0.base_53 v_my_callbackThread1of1ForFork0_~__mptr~0.base_11) (= |v_#memory_int_196| (store |v_#memory_int_197| v_my_callbackThread1of1ForFork0_~data~0.base_53 (store (select |v_#memory_int_197| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0 1))) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_5| v_my_callbackThread1of1ForFork0_~arg.base_5) (= v_~my_dev~0.offset_16 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_11) (= |v_#memory_$Pointer$.offset_161| (store |v_#memory_$Pointer$.offset_162| v_my_callbackThread1of1ForFork0_~data~0.base_53 (store (select |v_#memory_$Pointer$.offset_162| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0 (select (select |v_#memory_$Pointer$.offset_161| v_my_callbackThread1of1ForFork0_~data~0.base_53) .cse0)))) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_11 v_~my_dev~0.base_16) (= v_my_callbackThread1of1ForFork0_~arg.offset_5 |v_my_callbackThread1of1ForFork0_#in~arg.offset_5|) (= (+ v_my_callbackThread1of1ForFork0_~__mptr~0.offset_11 (- 24)) v_my_callbackThread1of1ForFork0_~data~0.offset_53))) InVars {my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_162|, ~my_dev~0.base=v_~my_dev~0.base_16, #memory_int=|v_#memory_int_197|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_5|, ~my_dev~0.offset=v_~my_dev~0.offset_16, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_162|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_161|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_5, ~my_dev~0.base=v_~my_dev~0.base_16, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_5|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_11, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_53, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_53, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_5|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_5, #memory_int=|v_#memory_int_196|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_11, ~my_dev~0.offset=v_~my_dev~0.offset_16, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_161|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~data~0.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~data~0.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:29,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [363] [363] L1713-2-->L1714-1: Formula: (and (= (store |v_#memory_int_36| |v_~#t2~0.base_5| (store (select |v_#memory_int_36| |v_~#t2~0.base_5|) |v_~#t2~0.offset_5| 1)) |v_#memory_int_35|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_~#t2~0.base_5| (store (select |v_#memory_$Pointer$.offset_24| |v_~#t2~0.base_5|) |v_~#t2~0.offset_5| (select (select |v_#memory_$Pointer$.offset_23| |v_~#t2~0.base_5|) |v_~#t2~0.offset_5|)))) (= (store |v_#memory_$Pointer$.base_24| |v_~#t2~0.base_5| (store (select |v_#memory_$Pointer$.base_24| |v_~#t2~0.base_5|) |v_~#t2~0.offset_5| (select (select |v_#memory_$Pointer$.base_23| |v_~#t2~0.base_5|) |v_~#t2~0.offset_5|))) |v_#memory_$Pointer$.base_23|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ~#t2~0.offset=|v_~#t2~0.offset_5|, #memory_int=|v_#memory_int_36|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ~#t2~0.base=|v_~#t2~0.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ~#t2~0.offset=|v_~#t2~0.offset_5|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ~#t2~0.base=|v_~#t2~0.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet34, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:29,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [473] [473] my_callbackENTRY-->L1699-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_28 24))) (and (= v_my_callbackThread1of1ForFork1_~data~0.base_28 v_my_callbackThread1of1ForFork1_~__mptr~0.base_10) (= (store |v_#memory_int_209| v_my_callbackThread1of1ForFork1_~data~0.base_28 (store (select |v_#memory_int_209| v_my_callbackThread1of1ForFork1_~data~0.base_28) .cse0 1)) |v_#memory_int_208|) (= (store |v_#memory_$Pointer$.base_174| v_my_callbackThread1of1ForFork1_~data~0.base_28 (store (select |v_#memory_$Pointer$.base_174| v_my_callbackThread1of1ForFork1_~data~0.base_28) .cse0 (select (select |v_#memory_$Pointer$.base_173| v_my_callbackThread1of1ForFork1_~data~0.base_28) .cse0))) |v_#memory_$Pointer$.base_173|) (= |v_my_callbackThread1of1ForFork1_#in~arg.offset_4| v_my_callbackThread1of1ForFork1_~arg.offset_4) (= v_~my_dev~0.offset_17 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_10) (= |v_#memory_$Pointer$.offset_173| (store |v_#memory_$Pointer$.offset_174| v_my_callbackThread1of1ForFork1_~data~0.base_28 (store (select |v_#memory_$Pointer$.offset_174| v_my_callbackThread1of1ForFork1_~data~0.base_28) .cse0 (select (select |v_#memory_$Pointer$.offset_173| v_my_callbackThread1of1ForFork1_~data~0.base_28) .cse0)))) (= (+ v_my_callbackThread1of1ForFork1_~__mptr~0.offset_10 (- 24)) v_my_callbackThread1of1ForFork1_~data~0.offset_28) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_10 v_~my_dev~0.base_17) (= |v_my_callbackThread1of1ForFork1_#in~arg.base_4| v_my_callbackThread1of1ForFork1_~arg.base_4))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_4|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_174|, ~my_dev~0.base=v_~my_dev~0.base_17, #memory_int=|v_#memory_int_209|, ~my_dev~0.offset=v_~my_dev~0.offset_17, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_174|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_4|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_173|, ~my_dev~0.base=v_~my_dev~0.base_17, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_4, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_10, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_4|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_4|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_28, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_28, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_4, #memory_int=|v_#memory_int_208|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_10, ~my_dev~0.offset=v_~my_dev~0.offset_17, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_173|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:29,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [454] [454] L1700-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_42 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.offset_12| 0) (= |v_#memory_$Pointer$.base_136| (store |v_#memory_$Pointer$.base_137| v_my_callbackThread1of1ForFork0_~data~0.base_42 (store (select |v_#memory_$Pointer$.base_137| v_my_callbackThread1of1ForFork0_~data~0.base_42) .cse0 (select (select |v_#memory_$Pointer$.base_136| v_my_callbackThread1of1ForFork0_~data~0.base_42) .cse0)))) (= (store |v_#memory_int_165| v_my_callbackThread1of1ForFork0_~data~0.base_42 (store (select |v_#memory_int_165| v_my_callbackThread1of1ForFork0_~data~0.base_42) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem30_26| 1))) |v_#memory_int_164|) (= |v_#memory_$Pointer$.offset_136| (store |v_#memory_$Pointer$.offset_137| v_my_callbackThread1of1ForFork0_~data~0.base_42 (store (select |v_#memory_$Pointer$.offset_137| v_my_callbackThread1of1ForFork0_~data~0.base_42) .cse0 (select (select |v_#memory_$Pointer$.offset_136| v_my_callbackThread1of1ForFork0_~data~0.base_42) .cse0)))) (= |v_my_callbackThread1of1ForFork0_#res.base_12| 0))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_42, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_137|, #memory_int=|v_#memory_int_165|, my_callbackThread1of1ForFork0_#t~mem30=|v_my_callbackThread1of1ForFork0_#t~mem30_26|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_42, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_137|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_42, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_12|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_136|, #memory_int=|v_#memory_int_164|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_12|, my_callbackThread1of1ForFork0_#t~mem30=|v_my_callbackThread1of1ForFork0_#t~mem30_25|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_42, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_136|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, my_callbackThread1of1ForFork0_#t~mem30, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:29,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [478] [478] L1700-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_31 28))) (and (= |v_my_callbackThread1of1ForFork1_#res.base_10| 0) (= |v_#memory_int_219| (store |v_#memory_int_220| v_my_callbackThread1of1ForFork1_~data~0.base_31 (store (select |v_#memory_int_220| v_my_callbackThread1of1ForFork1_~data~0.base_31) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem30_25| 1)))) (= |v_my_callbackThread1of1ForFork1_#res.offset_10| 0) (= |v_#memory_$Pointer$.offset_181| (store |v_#memory_$Pointer$.offset_182| v_my_callbackThread1of1ForFork1_~data~0.base_31 (store (select |v_#memory_$Pointer$.offset_182| v_my_callbackThread1of1ForFork1_~data~0.base_31) .cse0 (select (select |v_#memory_$Pointer$.offset_181| v_my_callbackThread1of1ForFork1_~data~0.base_31) .cse0)))) (= (store |v_#memory_$Pointer$.base_182| v_my_callbackThread1of1ForFork1_~data~0.base_31 (store (select |v_#memory_$Pointer$.base_182| v_my_callbackThread1of1ForFork1_~data~0.base_31) .cse0 (select (select |v_#memory_$Pointer$.base_181| v_my_callbackThread1of1ForFork1_~data~0.base_31) .cse0))) |v_#memory_$Pointer$.base_181|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_31, my_callbackThread1of1ForFork1_#t~mem30=|v_my_callbackThread1of1ForFork1_#t~mem30_25|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_31, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_182|, #memory_int=|v_#memory_int_220|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_182|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_31, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_10|, my_callbackThread1of1ForFork1_#t~mem30=|v_my_callbackThread1of1ForFork1_#t~mem30_24|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_31, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_181|, #memory_int=|v_#memory_int_219|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_181|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork1_#t~mem30, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:29,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] L1714-2-->L1737-3: Formula: (and (= |v_ULTIMATE.start_my_drv_probe_#res_12| |v_ULTIMATE.start_main_#t~ret41_18|) (= |v_ULTIMATE.start_my_drv_probe_#res_12| 0)) InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_12|, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_18|, ULTIMATE.start_my_drv_probe_#t~nondet35=|v_ULTIMATE.start_my_drv_probe_#t~nondet35_5|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res, ULTIMATE.start_main_#t~ret41, ULTIMATE.start_my_drv_probe_#t~nondet35] because there is no mapped edge [2019-12-27 00:25:29,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [489] [489] L1737-3-->L1722: Formula: (and (= 0 (select |v_#valid_77| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_33|)) (= |v_ULTIMATE.start_main_~#data~1.offset_97| |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_16|) (= |v_ULTIMATE.start_main_#t~ret41_34| v_ULTIMATE.start_main_~probe_ret~0_35) (= |v_#length_50| (store |v_#length_51| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_33| 4)) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_33|) (= 0 v_ULTIMATE.start_main_~probe_ret~0_35) (= (store |v_#valid_77| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_33| 1) |v_#valid_76|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_30| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_16| v_ULTIMATE.start_my_drv_disconnect_~data.offset_16) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_33| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_16| |v_ULTIMATE.start_main_~#data~1.base_102|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_16| v_ULTIMATE.start_my_drv_disconnect_~data.base_16) (= (select (select |v_#memory_int_266| |v_~#t1~0.base_22|) |v_~#t1~0.offset_22|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem36_28|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, ~#t1~0.base=|v_~#t1~0.base_22|, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_34|, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_266|, ~#t1~0.offset=|v_~#t1~0.offset_22|, #length=|v_#length_51|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_97|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_102|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_16, ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_27|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset_19|, ULTIMATE.start_my_drv_disconnect_#in~data.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_16|, ULTIMATE.start_my_drv_disconnect_#t~mem36=|v_ULTIMATE.start_my_drv_disconnect_#t~mem36_28|, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_33|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.base_19|, ~#t1~0.offset=|v_~#t1~0.offset_22|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ~#t1~0.base=|v_~#t1~0.base_22|, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_16, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_33|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset_12|, #valid=|v_#valid_76|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.base_12|, #memory_int=|v_#memory_int_266|, #length=|v_#length_50|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_97|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_35, ULTIMATE.start_my_drv_disconnect_#in~data.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data.base_16|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_102|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem38, ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset, ULTIMATE.start_my_drv_disconnect_#in~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem36, ULTIMATE.start_main_#t~ret41, ULTIMATE.start_my_drv_disconnect_#t~nondet37.base, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~data.base, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet39.base, #length, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_my_drv_disconnect_#in~data.base] because there is no mapped edge [2019-12-27 00:25:29,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [450] [450] L1722-2-->L1723-1: Formula: (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem38_18| (select (select |v_#memory_int_158| |v_~#t2~0.base_20|) |v_~#t2~0.offset_20|)) InVars {~#t2~0.offset=|v_~#t2~0.offset_20|, #memory_int=|v_#memory_int_158|, ~#t2~0.base=|v_~#t2~0.base_20|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_18|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem36=|v_ULTIMATE.start_my_drv_disconnect_#t~mem36_11|, ~#t2~0.offset=|v_~#t2~0.offset_20|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.base_11|, #memory_int=|v_#memory_int_158|, ~#t2~0.base=|v_~#t2~0.base_20|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem38, ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset, ULTIMATE.start_my_drv_disconnect_#t~mem36, ULTIMATE.start_my_drv_disconnect_#t~nondet37.base] because there is no mapped edge [2019-12-27 00:25:29,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [508] [508] L1723-3-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_303| |v_ULTIMATE.start_main_~#data~1.base_124|))) (and (not (= |v_ULTIMATE.start_main_#t~mem43_27| 2)) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1.offset_119| 28)) |v_ULTIMATE.start_main_#t~mem43_27|) (= |v_#valid_94| (store |v_#valid_95| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37| 0)) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1.offset_119| 24)) 1) (= 0 v_ULTIMATE.start_ldv_assert_~expression_110) (= v_ULTIMATE.start_ldv_assert_~expression_110 |v_ULTIMATE.start_ldv_assert_#in~expression_93|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_37|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_303|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_119|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_124|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_30|, ULTIMATE.start_main_#t~mem43=|v_ULTIMATE.start_main_#t~mem43_27|, ULTIMATE.start_main_#t~mem42=|v_ULTIMATE.start_main_#t~mem42_29|, ULTIMATE.start_ldv_assert_#in~expression=|v_ULTIMATE.start_ldv_assert_#in~expression_93|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_110, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_33|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_36|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset_13|, #valid=|v_#valid_94|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.base_13|, #memory_int=|v_#memory_int_303|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_119|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_124|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem38, 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_my_drv_disconnect_#t~nondet39.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet39.base, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2019-12-27 00:25:29,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:25:29 BasicIcfg [2019-12-27 00:25:29,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:25:29,414 INFO L168 Benchmark]: Toolchain (without parser) took 41709.67 ms. Allocated memory was 145.2 MB in the beginning and 333.4 MB in the end (delta: 188.2 MB). Free memory was 99.5 MB in the beginning and 161.1 MB in the end (delta: -61.6 MB). Peak memory consumption was 126.6 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:29,415 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 00:25:29,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1449.11 ms. Allocated memory was 145.2 MB in the beginning and 239.1 MB in the end (delta: 93.8 MB). Free memory was 99.2 MB in the beginning and 172.5 MB in the end (delta: -73.3 MB). Peak memory consumption was 75.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:29,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.99 ms. Allocated memory is still 239.1 MB. Free memory was 171.1 MB in the beginning and 168.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:29,420 INFO L168 Benchmark]: Boogie Preprocessor took 75.81 ms. Allocated memory is still 239.1 MB. Free memory was 168.2 MB in the beginning and 165.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:29,421 INFO L168 Benchmark]: RCFGBuilder took 843.77 ms. Allocated memory is still 239.1 MB. Free memory was 165.3 MB in the beginning and 119.4 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:29,424 INFO L168 Benchmark]: TraceAbstraction took 39221.48 ms. Allocated memory was 239.1 MB in the beginning and 333.4 MB in the end (delta: 94.4 MB). Free memory was 117.9 MB in the beginning and 161.1 MB in the end (delta: -43.1 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:29,431 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1449.11 ms. Allocated memory was 145.2 MB in the beginning and 239.1 MB in the end (delta: 93.8 MB). Free memory was 99.2 MB in the beginning and 172.5 MB in the end (delta: -73.3 MB). Peak memory consumption was 75.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 113.99 ms. Allocated memory is still 239.1 MB. Free memory was 171.1 MB in the beginning and 168.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.81 ms. Allocated memory is still 239.1 MB. Free memory was 168.2 MB in the beginning and 165.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.77 ms. Allocated memory is still 239.1 MB. Free memory was 165.3 MB in the beginning and 119.4 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39221.48 ms. Allocated memory was 239.1 MB in the beginning and 333.4 MB in the end (delta: 94.4 MB). Free memory was 117.9 MB in the beginning and 161.1 MB in the end (delta: -43.1 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 26.2s, 144 ProgramPointsBefore, 36 ProgramPointsAfterwards, 148 TransitionsBefore, 35 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 15 ConcurrentYvCompositions, 6 ChoiceCompositions, 995 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 6 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 13.9s, 0 MoverChecksTotal, 3024 CheckedPairsTotal, 157 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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}] [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}] [L1700] 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}] [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] 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}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Result: UNSAFE, OverallTime: 39.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 257 SDtfs, 378 SDslu, 660 SDs, 0 SdLazy, 1714 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 6.1s 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, 11 MinimizatonAttempts, 280 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 46073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...