/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:21:31,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:21:31,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:21:31,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:21:31,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:21:31,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:21:31,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:21:31,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:21:31,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:21:31,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:21:31,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:21:31,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:21:31,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:21:31,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:21:31,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:21:31,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:21:31,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:21:31,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:21:31,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:21:31,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:21:31,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:21:31,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:21:31,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:21:31,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:21:31,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:21:31,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:21:31,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:21:31,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:21:31,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:21:31,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:21:31,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:21:31,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:21:31,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:21:31,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:21:31,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:21:31,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:21:31,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:21:31,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:21:31,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:21:31,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:21:31,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:21:31,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:21:31,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:21:31,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:21:31,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:21:31,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:21:31,592 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:21:31,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:21:31,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:21:31,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:21:31,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:21:31,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:21:31,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:21:31,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:21:31,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:21:31,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:21:31,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:21:31,595 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:21:31,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:21:31,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:21:31,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:21:31,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:21:31,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:21:31,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:21:31,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:21:31,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:21:31,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:21:31,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:21:31,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:21:31,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:21:31,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:21:31,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:21:31,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:21:31,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:21:31,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:21:31,908 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:21:31,908 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 04:21:31,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519e33e0a/98f133feea60435d99fbb99cf8a5a237/FLAG40e4eb33b [2019-12-27 04:21:32,623 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:21:32,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2019-12-27 04:21:32,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519e33e0a/98f133feea60435d99fbb99cf8a5a237/FLAG40e4eb33b [2019-12-27 04:21:32,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519e33e0a/98f133feea60435d99fbb99cf8a5a237 [2019-12-27 04:21:32,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:21:32,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:21:32,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:21:32,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:21:32,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:21:32,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:21:32" (1/1) ... [2019-12-27 04:21:32,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58700a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:32, skipping insertion in model container [2019-12-27 04:21:32,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:21:32" (1/1) ... [2019-12-27 04:21:32,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:21:32,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:21:33,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:21:33,687 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:21:33,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:21:34,161 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:21:34,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34 WrapperNode [2019-12-27 04:21:34,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:21:34,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:21:34,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:21:34,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:21:34,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:21:34,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:21:34,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:21:34,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:21:34,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (1/1) ... [2019-12-27 04:21:34,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:21:34,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:21:34,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:21:34,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:21:34,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (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 04:21:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:21:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 04:21:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 04:21:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:21:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:21:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 04:21:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 04:21:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:21:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:21:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 04:21:34,441 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 04:21:35,193 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:21:35,193 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 04:21:35,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:21:35 BoogieIcfgContainer [2019-12-27 04:21:35,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:21:35,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:21:35,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:21:35,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:21:35,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:21:32" (1/3) ... [2019-12-27 04:21:35,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f5de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:21:35, skipping insertion in model container [2019-12-27 04:21:35,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:21:34" (2/3) ... [2019-12-27 04:21:35,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f5de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:21:35, skipping insertion in model container [2019-12-27 04:21:35,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:21:35" (3/3) ... [2019-12-27 04:21:35,204 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2019-12-27 04:21:35,215 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:21:35,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:21:35,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 04:21:35,223 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:21:35,253 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,253 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,253 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,253 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,254 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,254 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,254 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,254 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,255 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,256 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,256 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,257 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,257 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,258 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,258 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,258 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,258 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,259 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,259 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,260 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,260 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,260 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,260 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,261 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,261 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,261 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,261 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,262 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,262 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,262 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,263 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,263 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,263 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,263 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,264 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,264 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,268 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,268 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,268 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,269 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,269 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,269 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,269 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,270 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,270 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,277 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,277 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,277 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,278 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,279 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,281 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:21:35,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 04:21:35,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:21:35,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:21:35,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:21:35,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:21:35,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:21:35,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:21:35,345 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:21:35,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:21:35,370 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions [2019-12-27 04:21:35,372 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions [2019-12-27 04:21:35,463 INFO L132 PetriNetUnfolder]: 11/186 cut-off events. [2019-12-27 04:21:35,463 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 04:21:35,476 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 04:21:35,483 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions [2019-12-27 04:21:35,575 INFO L132 PetriNetUnfolder]: 11/186 cut-off events. [2019-12-27 04:21:35,575 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 04:21:35,579 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 04:21:35,585 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2019-12-27 04:21:35,587 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:21:36,098 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 04:21:36,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:36,148 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 04:21:36,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:36,188 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 04:21:36,191 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 04:21:36,221 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 04:21:36,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:36,265 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 04:21:36,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:36,300 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 04:21:36,300 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 04:21:39,311 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 04:21:39,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:39,361 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 04:21:39,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:39,380 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 04:21:39,381 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-27 04:21:40,052 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 04:21:40,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:40,105 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 04:21:40,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:40,149 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 04:21:40,150 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 04:21:40,183 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 04:21:40,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:40,225 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 04:21:40,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:40,261 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 04:21:40,261 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 04:21:42,286 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 04:21:42,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:42,324 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 04:21:42,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:42,357 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 04:21:42,357 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 04:21:42,370 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 04:21:42,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:42,411 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 04:21:42,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:42,445 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 04:21:42,445 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 04:21:44,474 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 04:21:44,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:44,511 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 04:21:44,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:44,536 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 04:21:44,536 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 04:21:44,548 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 04:21:44,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:44,585 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 04:21:44,610 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:44,612 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 04:21:44,612 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 04:21:48,514 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 04:21:48,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:48,546 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 04:21:48,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:48,564 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 04:21:48,565 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-27 04:21:49,315 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 04:21:49,628 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-12-27 04:21:49,917 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-27 04:21:50,021 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-27 04:21:50,094 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 04:21:50,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:50,198 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 04:21:50,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:50,286 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 04:21:50,286 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2019-12-27 04:21:50,313 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 04:21:50,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:50,415 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 04:21:50,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:50,501 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 04:21:50,501 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2019-12-27 04:21:52,531 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 04:21:52,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:52,576 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 04:21:52,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:52,616 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 04:21:52,616 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2019-12-27 04:21:52,637 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 04:21:52,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:52,699 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 04:21:52,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:52,745 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 04:21:52,746 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-27 04:21:54,836 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 04:21:54,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:54,879 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 04:21:54,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:54,915 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 04:21:54,915 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2019-12-27 04:21:55,872 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-12-27 04:21:55,989 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-27 04:21:56,500 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-12-27 04:21:57,422 WARN L192 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2019-12-27 04:21:57,679 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-12-27 04:21:59,118 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2019-12-27 04:21:59,131 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 04:21:59,570 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 04:21:59,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:21:59,579 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 04:22:00,074 WARN L192 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 04:22:00,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:22:00,075 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 04:22:00,075 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-27 04:22:00,529 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 04:22:01,311 WARN L192 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-27 04:22:01,630 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 04:22:01,642 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3024 [2019-12-27 04:22:01,642 INFO L214 etLargeBlockEncoding]: Total number of compositions: 157 [2019-12-27 04:22:01,646 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 35 transitions [2019-12-27 04:22:01,664 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 209 states. [2019-12-27 04:22:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-12-27 04:22:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 04:22:01,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:01,673 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 04:22:01,674 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 04:22:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash 537, now seen corresponding path program 1 times [2019-12-27 04:22:01,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:01,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761294495] [2019-12-27 04:22:01,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:01,943 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 04:22:01,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761294495] [2019-12-27 04:22:01,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:01,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 04:22:01,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766699447] [2019-12-27 04:22:01,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 04:22:01,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:01,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 04:22:01,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 04:22:01,972 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 2 states. [2019-12-27 04:22:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:02,002 INFO L93 Difference]: Finished difference Result 207 states and 457 transitions. [2019-12-27 04:22:02,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 04:22:02,004 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 04:22:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:02,017 INFO L225 Difference]: With dead ends: 207 [2019-12-27 04:22:02,018 INFO L226 Difference]: Without dead ends: 172 [2019-12-27 04:22:02,019 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 04:22:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-27 04:22:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-12-27 04:22:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-12-27 04:22:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2019-12-27 04:22:02,077 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2019-12-27 04:22:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:02,077 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2019-12-27 04:22:02,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 04:22:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2019-12-27 04:22:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 04:22:02,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:02,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 04:22:02,079 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 04:22:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2019-12-27 04:22:02,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:02,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964032215] [2019-12-27 04:22:02,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:02,277 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 04:22:02,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964032215] [2019-12-27 04:22:02,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:02,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:22:02,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014436964] [2019-12-27 04:22:02,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:22:02,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:22:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:22:02,280 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2019-12-27 04:22:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:02,425 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2019-12-27 04:22:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:22:02,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 04:22:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:02,432 INFO L225 Difference]: With dead ends: 230 [2019-12-27 04:22:02,432 INFO L226 Difference]: Without dead ends: 230 [2019-12-27 04:22:02,432 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 04:22:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-27 04:22:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2019-12-27 04:22:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-27 04:22:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2019-12-27 04:22:02,464 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2019-12-27 04:22:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:02,464 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2019-12-27 04:22:02,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:22:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2019-12-27 04:22:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:22:02,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:02,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:22:02,469 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 04:22:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash 514428409, now seen corresponding path program 1 times [2019-12-27 04:22:02,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:02,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199712170] [2019-12-27 04:22:02,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:02,592 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 04:22:02,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199712170] [2019-12-27 04:22:02,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:02,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:22:02,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009678895] [2019-12-27 04:22:02,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:22:02,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:02,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:22:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:22:02,594 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2019-12-27 04:22:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:02,693 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2019-12-27 04:22:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:22:02,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:22:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:02,696 INFO L225 Difference]: With dead ends: 243 [2019-12-27 04:22:02,696 INFO L226 Difference]: Without dead ends: 236 [2019-12-27 04:22:02,697 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 04:22:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-27 04:22:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2019-12-27 04:22:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 04:22:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2019-12-27 04:22:02,712 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2019-12-27 04:22:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:02,712 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2019-12-27 04:22:02,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:22:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2019-12-27 04:22:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:22:02,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:02,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:22:02,718 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 04:22:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2130966860, now seen corresponding path program 1 times [2019-12-27 04:22:02,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:02,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048709470] [2019-12-27 04:22:02,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:22:02,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048709470] [2019-12-27 04:22:02,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:02,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:22:02,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752204052] [2019-12-27 04:22:02,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:22:02,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:02,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:22:02,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:22:02,815 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2019-12-27 04:22:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:02,831 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2019-12-27 04:22:02,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:22:02,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 04:22:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:02,832 INFO L225 Difference]: With dead ends: 86 [2019-12-27 04:22:02,832 INFO L226 Difference]: Without dead ends: 86 [2019-12-27 04:22:02,832 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 04:22:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-27 04:22:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-27 04:22:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 04:22:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2019-12-27 04:22:02,837 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2019-12-27 04:22:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:02,837 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2019-12-27 04:22:02,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:22:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2019-12-27 04:22:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:02,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:02,840 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 04:22:02,840 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 04:22:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -321590399, now seen corresponding path program 1 times [2019-12-27 04:22:02,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:02,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755143515] [2019-12-27 04:22:02,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:22:03,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755143515] [2019-12-27 04:22:03,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:03,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:22:03,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304905612] [2019-12-27 04:22:03,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:22:03,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:03,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:22:03,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:22:03,386 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2019-12-27 04:22:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:03,915 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2019-12-27 04:22:03,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:22:03,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 04:22:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:03,917 INFO L225 Difference]: With dead ends: 148 [2019-12-27 04:22:03,917 INFO L226 Difference]: Without dead ends: 148 [2019-12-27 04:22:03,918 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 04:22:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-27 04:22:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2019-12-27 04:22:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-27 04:22:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 201 transitions. [2019-12-27 04:22:03,923 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 201 transitions. Word has length 18 [2019-12-27 04:22:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:03,924 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 201 transitions. [2019-12-27 04:22:03,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:22:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 201 transitions. [2019-12-27 04:22:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:03,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:03,925 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 04:22:03,926 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 04:22:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash -321590379, now seen corresponding path program 1 times [2019-12-27 04:22:03,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:03,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041143609] [2019-12-27 04:22:03,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:04,290 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-12-27 04:22:04,894 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 04:22:04,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041143609] [2019-12-27 04:22:04,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:04,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:22:04,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267329120] [2019-12-27 04:22:04,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:22:04,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:22:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:22:04,897 INFO L87 Difference]: Start difference. First operand 109 states and 201 transitions. Second operand 12 states. [2019-12-27 04:22:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:05,959 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2019-12-27 04:22:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 04:22:05,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 04:22:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:05,960 INFO L225 Difference]: With dead ends: 149 [2019-12-27 04:22:05,960 INFO L226 Difference]: Without dead ends: 138 [2019-12-27 04:22:05,961 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 04:22:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-27 04:22:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2019-12-27 04:22:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-27 04:22:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 197 transitions. [2019-12-27 04:22:05,965 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 197 transitions. Word has length 18 [2019-12-27 04:22:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:05,965 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 197 transitions. [2019-12-27 04:22:05,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:22:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 197 transitions. [2019-12-27 04:22:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:05,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:05,967 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 04:22:05,967 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 04:22:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash -235778121, now seen corresponding path program 2 times [2019-12-27 04:22:05,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:05,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917139310] [2019-12-27 04:22:05,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:06,933 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 04:22:06,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917139310] [2019-12-27 04:22:06,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:06,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:22:06,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009607369] [2019-12-27 04:22:06,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:22:06,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:22:06,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:22:06,935 INFO L87 Difference]: Start difference. First operand 107 states and 197 transitions. Second operand 12 states. [2019-12-27 04:22:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:08,054 INFO L93 Difference]: Finished difference Result 151 states and 257 transitions. [2019-12-27 04:22:08,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:22:08,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 04:22:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:08,055 INFO L225 Difference]: With dead ends: 151 [2019-12-27 04:22:08,055 INFO L226 Difference]: Without dead ends: 136 [2019-12-27 04:22:08,056 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 04:22:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-27 04:22:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2019-12-27 04:22:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-27 04:22:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 193 transitions. [2019-12-27 04:22:08,060 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 193 transitions. Word has length 18 [2019-12-27 04:22:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:08,060 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 193 transitions. [2019-12-27 04:22:08,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:22:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 193 transitions. [2019-12-27 04:22:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:08,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:08,062 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 04:22:08,062 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 04:22:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash 794008717, now seen corresponding path program 3 times [2019-12-27 04:22:08,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:08,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672412904] [2019-12-27 04:22:08,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:08,303 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-27 04:22:08,428 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-12-27 04:22:08,545 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-12-27 04:22:09,008 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 04:22:09,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672412904] [2019-12-27 04:22:09,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:09,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:22:09,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871527029] [2019-12-27 04:22:09,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:22:09,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:22:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:22:09,010 INFO L87 Difference]: Start difference. First operand 105 states and 193 transitions. Second operand 12 states. [2019-12-27 04:22:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:10,000 INFO L93 Difference]: Finished difference Result 123 states and 220 transitions. [2019-12-27 04:22:10,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:22:10,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 04:22:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:10,002 INFO L225 Difference]: With dead ends: 123 [2019-12-27 04:22:10,002 INFO L226 Difference]: Without dead ends: 104 [2019-12-27 04:22:10,003 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 04:22:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-27 04:22:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2019-12-27 04:22:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 04:22:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2019-12-27 04:22:10,006 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 18 [2019-12-27 04:22:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:10,007 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2019-12-27 04:22:10,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:22:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2019-12-27 04:22:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:10,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:10,008 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 04:22:10,008 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 04:22:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1224207459, now seen corresponding path program 2 times [2019-12-27 04:22:10,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:10,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352973192] [2019-12-27 04:22:10,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:10,434 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 04:22:10,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352973192] [2019-12-27 04:22:10,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:10,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:22:10,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642868864] [2019-12-27 04:22:10,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:22:10,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:10,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:22:10,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:22:10,436 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand 7 states. [2019-12-27 04:22:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:10,951 INFO L93 Difference]: Finished difference Result 133 states and 244 transitions. [2019-12-27 04:22:10,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:22:10,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 04:22:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:10,957 INFO L225 Difference]: With dead ends: 133 [2019-12-27 04:22:10,957 INFO L226 Difference]: Without dead ends: 133 [2019-12-27 04:22:10,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:22:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-27 04:22:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 103. [2019-12-27 04:22:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-27 04:22:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 189 transitions. [2019-12-27 04:22:10,961 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 189 transitions. Word has length 18 [2019-12-27 04:22:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:10,962 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 189 transitions. [2019-12-27 04:22:10,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:22:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2019-12-27 04:22:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:10,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:10,963 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 04:22:10,963 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 04:22:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1224207479, now seen corresponding path program 4 times [2019-12-27 04:22:10,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:10,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136386434] [2019-12-27 04:22:10,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:11,941 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 04:22:11,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136386434] [2019-12-27 04:22:11,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:11,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:22:11,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44514183] [2019-12-27 04:22:11,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:22:11,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:11,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:22:11,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:22:11,943 INFO L87 Difference]: Start difference. First operand 103 states and 189 transitions. Second operand 12 states. [2019-12-27 04:22:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:13,059 INFO L93 Difference]: Finished difference Result 157 states and 264 transitions. [2019-12-27 04:22:13,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:22:13,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 04:22:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:13,061 INFO L225 Difference]: With dead ends: 157 [2019-12-27 04:22:13,061 INFO L226 Difference]: Without dead ends: 132 [2019-12-27 04:22:13,061 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 04:22:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-27 04:22:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2019-12-27 04:22:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-27 04:22:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2019-12-27 04:22:13,066 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2019-12-27 04:22:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:13,066 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2019-12-27 04:22:13,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:22:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2019-12-27 04:22:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:13,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:13,067 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 04:22:13,067 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 04:22:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1118582541, now seen corresponding path program 3 times [2019-12-27 04:22:13,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:13,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742687384] [2019-12-27 04:22:13,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:22:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:22:13,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742687384] [2019-12-27 04:22:13,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:22:13,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:22:13,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167023418] [2019-12-27 04:22:13,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:22:13,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:22:13,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:22:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:22:13,665 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 9 states. [2019-12-27 04:22:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:22:14,379 INFO L93 Difference]: Finished difference Result 172 states and 291 transitions. [2019-12-27 04:22:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:22:14,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-12-27 04:22:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:22:14,381 INFO L225 Difference]: With dead ends: 172 [2019-12-27 04:22:14,382 INFO L226 Difference]: Without dead ends: 172 [2019-12-27 04:22:14,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:22:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-27 04:22:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 119. [2019-12-27 04:22:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-27 04:22:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 218 transitions. [2019-12-27 04:22:14,387 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 218 transitions. Word has length 18 [2019-12-27 04:22:14,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:22:14,388 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 218 transitions. [2019-12-27 04:22:14,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:22:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 218 transitions. [2019-12-27 04:22:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:22:14,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:22:14,389 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 04:22:14,389 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 04:22:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:22:14,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1118582561, now seen corresponding path program 5 times [2019-12-27 04:22:14,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:22:14,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019983554] [2019-12-27 04:22:14,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:22:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:22:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:22:14,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:22:14,481 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:22:14,485 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 04:22:14,486 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 04:22:14,486 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 04:22:14,487 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 04:22:14,487 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 04:22:14,488 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 04:22:14,488 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 04:22:14,488 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)) (= (select (select |v_#memory_int_266| |v_~#t1~0.base_22|) |v_~#t1~0.offset_22|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem36_27|) (< |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)) 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_20|, 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_27|, 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_20|, ~#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 04:22:14,489 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_12|, ULTIMATE.start_my_drv_disconnect_#t~mem36=|v_ULTIMATE.start_my_drv_disconnect_#t~mem36_10|, ~#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_12|, #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 04:22:14,490 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 04:22:14,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:22:14 BasicIcfg [2019-12-27 04:22:14,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:22:14,528 INFO L168 Benchmark]: Toolchain (without parser) took 41704.93 ms. Allocated memory was 139.5 MB in the beginning and 349.2 MB in the end (delta: 209.7 MB). Free memory was 101.1 MB in the beginning and 229.1 MB in the end (delta: -127.9 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:22:14,528 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 04:22:14,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1342.46 ms. Allocated memory was 139.5 MB in the beginning and 238.0 MB in the end (delta: 98.6 MB). Free memory was 100.9 MB in the beginning and 171.0 MB in the end (delta: -70.1 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:22:14,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.72 ms. Allocated memory is still 238.0 MB. Free memory was 171.0 MB in the beginning and 168.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:22:14,535 INFO L168 Benchmark]: Boogie Preprocessor took 72.71 ms. Allocated memory is still 238.0 MB. Free memory was 168.1 MB in the beginning and 165.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 04:22:14,536 INFO L168 Benchmark]: RCFGBuilder took 820.87 ms. Allocated memory is still 238.0 MB. Free memory was 165.2 MB in the beginning and 117.3 MB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:22:14,537 INFO L168 Benchmark]: TraceAbstraction took 39327.52 ms. Allocated memory was 238.0 MB in the beginning and 349.2 MB in the end (delta: 111.1 MB). Free memory was 117.3 MB in the beginning and 229.1 MB in the end (delta: -111.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 04:22:14,545 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.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1342.46 ms. Allocated memory was 139.5 MB in the beginning and 238.0 MB in the end (delta: 98.6 MB). Free memory was 100.9 MB in the beginning and 171.0 MB in the end (delta: -70.1 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 136.72 ms. Allocated memory is still 238.0 MB. Free memory was 171.0 MB in the beginning and 168.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.71 ms. Allocated memory is still 238.0 MB. Free memory was 168.1 MB in the beginning and 165.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.87 ms. Allocated memory is still 238.0 MB. Free memory was 165.2 MB in the beginning and 117.3 MB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39327.52 ms. Allocated memory was 238.0 MB in the beginning and 349.2 MB in the end (delta: 111.1 MB). Free memory was 117.3 MB in the beginning and 229.1 MB in the end (delta: -111.8 MB). There was no memory consumed. 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: 14.0s, 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.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 6.4s, 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.2s 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...