/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:08:32,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:08:32,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:08:32,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:08:32,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:08:32,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:08:32,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:08:32,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:08:32,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:08:32,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:08:32,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:08:32,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:08:32,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:08:32,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:08:32,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:08:32,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:08:32,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:08:32,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:08:32,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:08:32,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:08:32,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:08:32,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:08:32,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:08:32,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:08:32,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:08:32,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:08:32,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:08:32,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:08:32,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:08:32,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:08:32,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:08:32,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:08:32,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:08:32,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:08:32,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:08:32,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:08:32,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:08:32,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:08:32,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:08:32,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:08:32,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:08:32,790 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-VariableLbe-MCR.epf [2019-12-27 23:08:32,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:08:32,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:08:32,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:08:32,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:08:32,816 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:08:32,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:08:32,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:08:32,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:08:32,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:08:32,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:08:32,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:08:32,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:08:32,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:08:32,818 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:08:32,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:08:32,818 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:08:32,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:08:32,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:08:32,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:08:32,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:08:32,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:08:32,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:08:32,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:08:32,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:08:32,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:08:32,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:08:32,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:08:32,820 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:08:32,821 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:08:32,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:08:32,821 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:08:32,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:08:33,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:08:33,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:08:33,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:08:33,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:08:33,122 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:08:33,122 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 23:08:33,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d60fe2/38040b16efc4490cbb6db033ed721f78/FLAG4b7bd8f45 [2019-12-27 23:08:33,784 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:08:33,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2019-12-27 23:08:33,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d60fe2/38040b16efc4490cbb6db033ed721f78/FLAG4b7bd8f45 [2019-12-27 23:08:34,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d60fe2/38040b16efc4490cbb6db033ed721f78 [2019-12-27 23:08:34,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:08:34,067 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:08:34,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:08:34,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:08:34,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:08:34,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:08:34" (1/1) ... [2019-12-27 23:08:34,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4007a815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:34, skipping insertion in model container [2019-12-27 23:08:34,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:08:34" (1/1) ... [2019-12-27 23:08:34,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:08:34,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:08:34,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:08:34,983 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:08:35,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:08:35,665 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:08:35,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35 WrapperNode [2019-12-27 23:08:35,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:08:35,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:08:35,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:08:35,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:08:35,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:08:35,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:08:35,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:08:35,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:08:35,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (1/1) ... [2019-12-27 23:08:35,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:08:35,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:08:35,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:08:35,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:08:35,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (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 23:08:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:08:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:08:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 23:08:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:08:36,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:08:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 23:08:36,008 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 23:08:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:08:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:08:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 23:08:36,011 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 23:08:36,903 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:08:36,903 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 23:08:36,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:08:36 BoogieIcfgContainer [2019-12-27 23:08:36,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:08:36,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:08:36,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:08:36,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:08:36,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:08:34" (1/3) ... [2019-12-27 23:08:36,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a508587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:08:36, skipping insertion in model container [2019-12-27 23:08:36,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:35" (2/3) ... [2019-12-27 23:08:36,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a508587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:08:36, skipping insertion in model container [2019-12-27 23:08:36,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:08:36" (3/3) ... [2019-12-27 23:08:36,914 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2019-12-27 23:08:36,924 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:08:36,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:08:36,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 23:08:36,934 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:08:36,969 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,969 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,969 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,969 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,970 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,970 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,970 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,971 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,972 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,972 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,972 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,973 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,973 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,973 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,973 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,973 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,974 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,974 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,974 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,975 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,975 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,975 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,975 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,976 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,977 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,977 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,977 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,977 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,978 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,978 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,978 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,978 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,979 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,979 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,979 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,979 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,980 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,980 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,980 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,984 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,985 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,985 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,985 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,985 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,986 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,986 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,986 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,986 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,996 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,996 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,997 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,997 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,998 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:36,998 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:37,029 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 23:08:37,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:08:37,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:08:37,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:08:37,049 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:08:37,050 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:08:37,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:08:37,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:08:37,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:08:37,069 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions [2019-12-27 23:08:37,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions [2019-12-27 23:08:37,155 INFO L132 PetriNetUnfolder]: 11/186 cut-off events. [2019-12-27 23:08:37,155 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 23:08:37,162 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 23:08:37,169 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions [2019-12-27 23:08:37,252 INFO L132 PetriNetUnfolder]: 11/186 cut-off events. [2019-12-27 23:08:37,252 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 23:08:37,255 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 23:08:37,262 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2019-12-27 23:08:37,264 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:08:38,744 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 23:08:38,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:38,775 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 23:08:38,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:38,807 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 23:08:38,807 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-27 23:08:41,326 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 23:08:41,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:41,368 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 23:08:41,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:41,394 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 23:08:41,394 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2019-12-27 23:08:42,219 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 23:08:42,512 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-12-27 23:08:42,880 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 23:08:42,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:42,922 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 23:08:42,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:42,956 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 23:08:42,957 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2019-12-27 23:08:43,873 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-12-27 23:08:44,023 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-27 23:08:44,450 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-12-27 23:08:44,632 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-27 23:08:45,270 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2019-12-27 23:08:45,497 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-12-27 23:08:46,586 WARN L192 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2019-12-27 23:08:46,607 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 23:08:46,974 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 23:08:46,974 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:46,983 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 23:08:47,310 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 23:08:47,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:47,312 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 23:08:47,312 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-27 23:08:47,629 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 23:08:48,217 WARN L192 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-27 23:08:48,489 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 23:08:48,499 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3024 [2019-12-27 23:08:48,499 INFO L214 etLargeBlockEncoding]: Total number of compositions: 157 [2019-12-27 23:08:48,503 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 35 transitions [2019-12-27 23:08:48,521 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 209 states. [2019-12-27 23:08:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-12-27 23:08:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 23:08:48,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:48,530 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 23:08:48,531 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 23:08:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash 537, now seen corresponding path program 1 times [2019-12-27 23:08:48,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:48,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302232189] [2019-12-27 23:08:48,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:08:48,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302232189] [2019-12-27 23:08:48,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:48,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 23:08:48,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995546955] [2019-12-27 23:08:48,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:48,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:48,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 23:08:48,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:48,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:48,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 23:08:48,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 23:08:48,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:08:48,901 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 2 states. [2019-12-27 23:08:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:48,935 INFO L93 Difference]: Finished difference Result 207 states and 457 transitions. [2019-12-27 23:08:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 23:08:48,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 23:08:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:48,964 INFO L225 Difference]: With dead ends: 207 [2019-12-27 23:08:48,964 INFO L226 Difference]: Without dead ends: 172 [2019-12-27 23:08:48,966 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 23:08:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-27 23:08:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-12-27 23:08:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-12-27 23:08:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2019-12-27 23:08:49,023 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2019-12-27 23:08:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:49,023 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2019-12-27 23:08:49,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 23:08:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2019-12-27 23:08:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 23:08:49,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:49,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 23:08:49,025 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 23:08:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2019-12-27 23:08:49,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:49,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795211401] [2019-12-27 23:08:49,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:49,213 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 23:08:49,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795211401] [2019-12-27 23:08:49,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:08:49,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113814008] [2019-12-27 23:08:49,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:49,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:49,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 23:08:49,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:49,216 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:49,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:08:49,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:08:49,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:08:49,219 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2019-12-27 23:08:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:49,376 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2019-12-27 23:08:49,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:08:49,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 23:08:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:49,383 INFO L225 Difference]: With dead ends: 230 [2019-12-27 23:08:49,383 INFO L226 Difference]: Without dead ends: 230 [2019-12-27 23:08:49,384 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 23:08:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-27 23:08:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2019-12-27 23:08:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-27 23:08:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2019-12-27 23:08:49,408 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2019-12-27 23:08:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:49,408 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2019-12-27 23:08:49,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:08:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2019-12-27 23:08:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 23:08:49,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:49,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 23:08:49,409 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 23:08:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 514428409, now seen corresponding path program 1 times [2019-12-27 23:08:49,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:49,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928234952] [2019-12-27 23:08:49,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:49,479 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 23:08:49,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928234952] [2019-12-27 23:08:49,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:49,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:08:49,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1001061521] [2019-12-27 23:08:49,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:49,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:49,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 23:08:49,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:49,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:49,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:08:49,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:49,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:08:49,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:08:49,485 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2019-12-27 23:08:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:49,589 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2019-12-27 23:08:49,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:08:49,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 23:08:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:49,593 INFO L225 Difference]: With dead ends: 243 [2019-12-27 23:08:49,593 INFO L226 Difference]: Without dead ends: 236 [2019-12-27 23:08:49,594 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 23:08:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-27 23:08:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2019-12-27 23:08:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 23:08:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2019-12-27 23:08:49,613 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2019-12-27 23:08:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:49,613 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2019-12-27 23:08:49,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:08:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2019-12-27 23:08:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:08:49,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:49,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:08:49,615 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 23:08:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:49,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2130966860, now seen corresponding path program 1 times [2019-12-27 23:08:49,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:49,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601612434] [2019-12-27 23:08:49,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:49,708 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 23:08:49,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601612434] [2019-12-27 23:08:49,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:49,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:08:49,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922731544] [2019-12-27 23:08:49,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:49,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:49,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:08:49,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:49,714 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:49,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:08:49,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:08:49,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:08:49,715 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2019-12-27 23:08:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:49,737 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2019-12-27 23:08:49,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:08:49,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 23:08:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:49,739 INFO L225 Difference]: With dead ends: 86 [2019-12-27 23:08:49,739 INFO L226 Difference]: Without dead ends: 86 [2019-12-27 23:08:49,739 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 23:08:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-27 23:08:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-27 23:08:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 23:08:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2019-12-27 23:08:49,745 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2019-12-27 23:08:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:49,745 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2019-12-27 23:08:49,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:08:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2019-12-27 23:08:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:08:49,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:49,747 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 23:08:49,747 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 23:08:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash -321590399, now seen corresponding path program 1 times [2019-12-27 23:08:49,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:49,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909463287] [2019-12-27 23:08:49,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:50,093 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 23:08:50,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909463287] [2019-12-27 23:08:50,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:50,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:08:50,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [702676825] [2019-12-27 23:08:50,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:50,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:50,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 23:08:50,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:50,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:50,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:08:50,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:50,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:08:50,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:08:50,112 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2019-12-27 23:08:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:50,561 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2019-12-27 23:08:50,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:08:50,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 23:08:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:50,563 INFO L225 Difference]: With dead ends: 148 [2019-12-27 23:08:50,563 INFO L226 Difference]: Without dead ends: 148 [2019-12-27 23:08:50,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:08:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-27 23:08:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2019-12-27 23:08:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-27 23:08:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 201 transitions. [2019-12-27 23:08:50,571 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 201 transitions. Word has length 18 [2019-12-27 23:08:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:50,572 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 201 transitions. [2019-12-27 23:08:50,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:08:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 201 transitions. [2019-12-27 23:08:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:08:50,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:50,573 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 23:08:50,574 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 23:08:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -321590379, now seen corresponding path program 1 times [2019-12-27 23:08:50,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:50,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030147830] [2019-12-27 23:08:50,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:51,220 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 23:08:51,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030147830] [2019-12-27 23:08:51,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:51,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:08:51,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760416611] [2019-12-27 23:08:51,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:51,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:51,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 23:08:51,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:51,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:51,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:08:51,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:51,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:08:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:08:51,234 INFO L87 Difference]: Start difference. First operand 109 states and 201 transitions. Second operand 12 states. [2019-12-27 23:08:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:52,282 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2019-12-27 23:08:52,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:08:52,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 23:08:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:52,286 INFO L225 Difference]: With dead ends: 149 [2019-12-27 23:08:52,286 INFO L226 Difference]: Without dead ends: 138 [2019-12-27 23:08:52,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:08:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-27 23:08:52,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2019-12-27 23:08:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-27 23:08:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 197 transitions. [2019-12-27 23:08:52,297 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 197 transitions. Word has length 18 [2019-12-27 23:08:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:52,297 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 197 transitions. [2019-12-27 23:08:52,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:08:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 197 transitions. [2019-12-27 23:08:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:08:52,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:52,302 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 23:08:52,302 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 23:08:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:52,303 INFO L82 PathProgramCache]: Analyzing trace with hash -235778121, now seen corresponding path program 2 times [2019-12-27 23:08:52,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:52,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407095509] [2019-12-27 23:08:52,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:53,124 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 23:08:53,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407095509] [2019-12-27 23:08:53,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:53,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:08:53,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753655110] [2019-12-27 23:08:53,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:53,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:53,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 28 transitions. [2019-12-27 23:08:53,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:53,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:08:53,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:08:53,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:08:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:08:53,252 INFO L87 Difference]: Start difference. First operand 107 states and 197 transitions. Second operand 14 states. [2019-12-27 23:08:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:54,607 INFO L93 Difference]: Finished difference Result 133 states and 234 transitions. [2019-12-27 23:08:54,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:08:54,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-27 23:08:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:54,609 INFO L225 Difference]: With dead ends: 133 [2019-12-27 23:08:54,609 INFO L226 Difference]: Without dead ends: 112 [2019-12-27 23:08:54,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:08:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-27 23:08:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2019-12-27 23:08:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 23:08:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2019-12-27 23:08:54,615 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 18 [2019-12-27 23:08:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:54,615 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2019-12-27 23:08:54,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:08:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2019-12-27 23:08:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:08:54,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:54,617 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 23:08:54,617 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 23:08:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1224207459, now seen corresponding path program 2 times [2019-12-27 23:08:54,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:54,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767179093] [2019-12-27 23:08:54,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:54,834 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 23:08:54,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767179093] [2019-12-27 23:08:54,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:54,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:08:54,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234341928] [2019-12-27 23:08:54,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:54,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:54,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 23:08:54,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:54,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:08:54,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:08:54,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:54,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:08:54,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:08:54,881 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand 8 states. [2019-12-27 23:08:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:55,369 INFO L93 Difference]: Finished difference Result 133 states and 244 transitions. [2019-12-27 23:08:55,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:08:55,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-27 23:08:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:55,372 INFO L225 Difference]: With dead ends: 133 [2019-12-27 23:08:55,372 INFO L226 Difference]: Without dead ends: 133 [2019-12-27 23:08:55,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:08:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-27 23:08:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 103. [2019-12-27 23:08:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-27 23:08:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 189 transitions. [2019-12-27 23:08:55,377 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 189 transitions. Word has length 18 [2019-12-27 23:08:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:55,377 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 189 transitions. [2019-12-27 23:08:55,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:08:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2019-12-27 23:08:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:08:55,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:55,379 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 23:08:55,379 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 23:08:55,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:55,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1224207479, now seen corresponding path program 3 times [2019-12-27 23:08:55,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:55,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734640034] [2019-12-27 23:08:55,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:08:55,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734640034] [2019-12-27 23:08:55,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:55,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:08:55,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292297505] [2019-12-27 23:08:55,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:55,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:55,993 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 23:08:55,993 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:56,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:08:56,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:08:56,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:08:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:08:56,040 INFO L87 Difference]: Start difference. First operand 103 states and 189 transitions. Second operand 13 states. [2019-12-27 23:08:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:57,081 INFO L93 Difference]: Finished difference Result 157 states and 264 transitions. [2019-12-27 23:08:57,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:08:57,082 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-12-27 23:08:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:57,084 INFO L225 Difference]: With dead ends: 157 [2019-12-27 23:08:57,084 INFO L226 Difference]: Without dead ends: 132 [2019-12-27 23:08:57,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:08:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-27 23:08:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2019-12-27 23:08:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-27 23:08:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2019-12-27 23:08:57,088 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2019-12-27 23:08:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:57,089 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2019-12-27 23:08:57,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:08:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2019-12-27 23:08:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:08:57,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:57,090 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 23:08:57,090 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 23:08:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1118582541, now seen corresponding path program 3 times [2019-12-27 23:08:57,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:57,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288042683] [2019-12-27 23:08:57,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:57,353 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 23:08:57,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288042683] [2019-12-27 23:08:57,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:57,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:08:57,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216756985] [2019-12-27 23:08:57,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:57,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:57,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 26 transitions. [2019-12-27 23:08:57,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:57,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:57,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:08:57,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:08:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:08:57,363 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 9 states. [2019-12-27 23:08:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:58,142 INFO L93 Difference]: Finished difference Result 172 states and 291 transitions. [2019-12-27 23:08:58,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:08:58,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-12-27 23:08:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:58,145 INFO L225 Difference]: With dead ends: 172 [2019-12-27 23:08:58,145 INFO L226 Difference]: Without dead ends: 172 [2019-12-27 23:08:58,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:08:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-27 23:08:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 119. [2019-12-27 23:08:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-27 23:08:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 218 transitions. [2019-12-27 23:08:58,152 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 218 transitions. Word has length 18 [2019-12-27 23:08:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:58,152 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 218 transitions. [2019-12-27 23:08:58,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:08:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 218 transitions. [2019-12-27 23:08:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:08:58,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:58,155 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 23:08:58,155 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 23:08:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1118582561, now seen corresponding path program 4 times [2019-12-27 23:08:58,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:58,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134902108] [2019-12-27 23:08:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:08:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:08:58,266 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:08:58,267 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:08:58,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [511] [511] ULTIMATE.startENTRY-->L1713-1: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (let ((.cse7 (store .cse0 |v_~#t1~0.base_21| 1))) (let ((.cse2 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_32 24)) (.cse3 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_32 28)) (.cse5 (store .cse7 |v_~#t2~0.base_18| 1))) (and (= (select .cse0 |v_~#t1~0.base_21|) 0) (= |v_#NULL.base_11| 0) (< |v_#StackHeapBarrier_26| |v_~#t1~0.base_21|) (= v_~my_dev~0.base_22 v_ULTIMATE.start_my_drv_probe_~data.base_32) (= |v_#memory_$Pointer$.offset_81| (let ((.cse1 (store |v_#memory_$Pointer$.offset_83| v_ULTIMATE.start_my_drv_probe_~data.base_32 (store (store (select |v_#memory_$Pointer$.offset_83| v_ULTIMATE.start_my_drv_probe_~data.base_32) .cse2 v_DerPreprocessor_31) .cse3 v_DerPreprocessor_33)))) (store .cse1 |v_~#t1~0.base_21| (store (select .cse1 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| (select (select |v_#memory_$Pointer$.offset_81| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|))))) (= v_~my_dev~0.offset_22 .cse2) (< 0 |v_#StackHeapBarrier_26|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| v_ULTIMATE.start_my_drv_probe_~data.base_32) (= |v_~#t1~0.offset_21| 0) (= 0 (select (select |v_#memory_int_134| |v_~#t2~0.base_18|) |v_~#t2~0.offset_18|)) (= v_ULTIMATE.start_ldv_assert_~expression_108 |v_ULTIMATE.start_ldv_assert_#in~expression_80|) (= (let ((.cse4 (store |v_#memory_$Pointer$.base_83| v_ULTIMATE.start_my_drv_probe_~data.base_32 (store (store (select |v_#memory_$Pointer$.base_83| v_ULTIMATE.start_my_drv_probe_~data.base_32) .cse2 v_DerPreprocessor_32) .cse3 v_DerPreprocessor_34)))) (store .cse4 |v_~#t1~0.base_21| (store (select .cse4 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| (select (select |v_#memory_$Pointer$.base_81| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|)))) |v_#memory_$Pointer$.base_81|) (= (store .cse5 |v_ULTIMATE.start_main_~#data~1.base_73| 1) |v_#valid_84|) (= v_ULTIMATE.start_my_drv_probe_~res~0_21 0) (= 0 v_ULTIMATE.start_main_~ret~0_24) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#data~1.base_73|) (= |v_#memory_int_132| (let ((.cse6 (store |v_#memory_int_134| v_ULTIMATE.start_my_drv_probe_~data.base_32 (store (store (select |v_#memory_int_134| v_ULTIMATE.start_my_drv_probe_~data.base_32) .cse2 0) .cse3 0)))) (store .cse6 |v_~#t1~0.base_21| (store (select .cse6 |v_~#t1~0.base_21|) |v_~#t1~0.offset_21| 0)))) (= |v_ULTIMATE.start_main_~#data~1.offset_68| 0) (= |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_#NULL.offset_11|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_15| |v_ULTIMATE.start_main_~#data~1.offset_68|) (= (store (store (store |v_#length_53| |v_~#t1~0.base_21| 4) |v_~#t2~0.base_18| 4) |v_ULTIMATE.start_main_~#data~1.base_73| 32) |v_#length_52|) (< |v_#StackHeapBarrier_26| |v_~#t2~0.base_18|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_15| |v_ULTIMATE.start_main_~#data~1.base_73|) (= (select (select |v_#memory_int_134| |v_~#t1~0.base_21|) |v_~#t1~0.offset_21|) 0) (= 1 |v_ULTIMATE.start_ldv_assert_#in~expression_80|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#data~1.base_73|)) (= 0 |v_ULTIMATE.start_my_drv_init_#res_15|) (= 0 (select .cse7 |v_~#t2~0.base_18|)) (= |v_~#t2~0.offset_18| 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_21|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_83|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_134|, #length=|v_#length_53|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_83|} OutVars{ULTIMATE.start_main_#t~mem45=|v_ULTIMATE.start_main_#t~mem45_31|, ULTIMATE.start_main_#t~mem43=|v_ULTIMATE.start_main_#t~mem43_30|, ULTIMATE.start_main_#t~mem44=|v_ULTIMATE.start_main_#t~mem44_23|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_81|, 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_21|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_108, ~#t1~0.base=|v_~#t1~0.base_21|, 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_18|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_68|, #length=|v_#length_52|, ~my_dev~0.offset=v_~my_dev~0.offset_22, ~#t2~0.base=|v_~#t2~0.base_18|, #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_26|, ~my_dev~0.base=v_~my_dev~0.base_22, 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_80|, #NULL.base=|v_#NULL.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, 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_16|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_132|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_30, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_73|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_81|} AuxVars[v_DerPreprocessor_33, v_DerPreprocessor_34, v_DerPreprocessor_31, v_DerPreprocessor_32] 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 23:08:58,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [468] [468] my_callbackENTRY-->L1699-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_13 24))) (and (= (+ v_my_callbackThread1of1ForFork0_~__mptr~0.offset_7 (- 24)) v_my_callbackThread1of1ForFork0_~data~0.offset_13) (= (store |v_#memory_int_85| v_my_callbackThread1of1ForFork0_~data~0.base_13 (store (select |v_#memory_int_85| v_my_callbackThread1of1ForFork0_~data~0.base_13) .cse0 1)) |v_#memory_int_84|) (= v_~my_dev~0.offset_12 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_7) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_5| v_my_callbackThread1of1ForFork0_~arg.base_5) (= (store |v_#memory_$Pointer$.base_50| v_my_callbackThread1of1ForFork0_~data~0.base_13 (store (select |v_#memory_$Pointer$.base_50| v_my_callbackThread1of1ForFork0_~data~0.base_13) .cse0 (select (select |v_#memory_$Pointer$.base_49| v_my_callbackThread1of1ForFork0_~data~0.base_13) .cse0))) |v_#memory_$Pointer$.base_49|) (= v_my_callbackThread1of1ForFork0_~data~0.base_13 v_my_callbackThread1of1ForFork0_~__mptr~0.base_7) (= |v_#memory_$Pointer$.offset_49| (store |v_#memory_$Pointer$.offset_50| v_my_callbackThread1of1ForFork0_~data~0.base_13 (store (select |v_#memory_$Pointer$.offset_50| v_my_callbackThread1of1ForFork0_~data~0.base_13) .cse0 (select (select |v_#memory_$Pointer$.offset_49| v_my_callbackThread1of1ForFork0_~data~0.base_13) .cse0)))) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_7 v_~my_dev~0.base_12) (= v_my_callbackThread1of1ForFork0_~arg.offset_5 |v_my_callbackThread1of1ForFork0_#in~arg.offset_5|))) InVars {my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_50|, ~my_dev~0.base=v_~my_dev~0.base_12, #memory_int=|v_#memory_int_85|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_5|, ~my_dev~0.offset=v_~my_dev~0.offset_12, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_50|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_49|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_5, ~my_dev~0.base=v_~my_dev~0.base_12, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_5|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_7, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_13, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_13, 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_84|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_7, ~my_dev~0.offset=v_~my_dev~0.offset_12, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_49|} 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 23:08:58,272 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 23:08:58,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [473] [473] my_callbackENTRY-->L1699-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_12 24))) (and (= (store |v_#memory_$Pointer$.offset_54| v_my_callbackThread1of1ForFork1_~data~0.base_12 (store (select |v_#memory_$Pointer$.offset_54| v_my_callbackThread1of1ForFork1_~data~0.base_12) .cse0 (select (select |v_#memory_$Pointer$.offset_53| v_my_callbackThread1of1ForFork1_~data~0.base_12) .cse0))) |v_#memory_$Pointer$.offset_53|) (= (+ v_my_callbackThread1of1ForFork1_~__mptr~0.offset_8 (- 24)) v_my_callbackThread1of1ForFork1_~data~0.offset_12) (= |v_my_callbackThread1of1ForFork1_#in~arg.offset_4| v_my_callbackThread1of1ForFork1_~arg.offset_4) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_8 v_my_callbackThread1of1ForFork1_~data~0.base_12) (= |v_#memory_$Pointer$.base_53| (store |v_#memory_$Pointer$.base_54| v_my_callbackThread1of1ForFork1_~data~0.base_12 (store (select |v_#memory_$Pointer$.base_54| v_my_callbackThread1of1ForFork1_~data~0.base_12) .cse0 (select (select |v_#memory_$Pointer$.base_53| v_my_callbackThread1of1ForFork1_~data~0.base_12) .cse0)))) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_8 v_~my_dev~0.base_13) (= v_~my_dev~0.offset_13 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_8) (= (store |v_#memory_int_89| v_my_callbackThread1of1ForFork1_~data~0.base_12 (store (select |v_#memory_int_89| v_my_callbackThread1of1ForFork1_~data~0.base_12) .cse0 1)) |v_#memory_int_88|) (= |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_54|, ~my_dev~0.base=v_~my_dev~0.base_13, #memory_int=|v_#memory_int_89|, ~my_dev~0.offset=v_~my_dev~0.offset_13, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_54|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_4|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_53|, ~my_dev~0.base=v_~my_dev~0.base_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_4, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_8, 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_12, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_12, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_4, #memory_int=|v_#memory_int_88|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_8, ~my_dev~0.offset=v_~my_dev~0.offset_13, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_53|} 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 23:08:58,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [454] [454] L1700-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_12 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.offset_10| 0) (= (store |v_#memory_int_73| v_my_callbackThread1of1ForFork0_~data~0.base_12 (store (select |v_#memory_int_73| v_my_callbackThread1of1ForFork0_~data~0.base_12) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem30_10| 1))) |v_#memory_int_72|) (= (store |v_#memory_$Pointer$.base_45| v_my_callbackThread1of1ForFork0_~data~0.base_12 (store (select |v_#memory_$Pointer$.base_45| v_my_callbackThread1of1ForFork0_~data~0.base_12) .cse0 (select (select |v_#memory_$Pointer$.base_44| v_my_callbackThread1of1ForFork0_~data~0.base_12) .cse0))) |v_#memory_$Pointer$.base_44|) (= |v_my_callbackThread1of1ForFork0_#res.base_10| 0) (= |v_#memory_$Pointer$.offset_44| (store |v_#memory_$Pointer$.offset_45| v_my_callbackThread1of1ForFork0_~data~0.base_12 (store (select |v_#memory_$Pointer$.offset_45| v_my_callbackThread1of1ForFork0_~data~0.base_12) .cse0 (select (select |v_#memory_$Pointer$.offset_44| v_my_callbackThread1of1ForFork0_~data~0.base_12) .cse0)))))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_12, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_45|, #memory_int=|v_#memory_int_73|, my_callbackThread1of1ForFork0_#t~mem30=|v_my_callbackThread1of1ForFork0_#t~mem30_10|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_12, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_45|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_12, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_44|, #memory_int=|v_#memory_int_72|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_10|, my_callbackThread1of1ForFork0_#t~mem30=|v_my_callbackThread1of1ForFork0_#t~mem30_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_12, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_44|} 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 23:08:58,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [478] [478] L1700-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_13 28))) (and (= |v_my_callbackThread1of1ForFork1_#res.base_10| 0) (= |v_my_callbackThread1of1ForFork1_#res.offset_10| 0) (= (store |v_#memory_$Pointer$.offset_58| v_my_callbackThread1of1ForFork1_~data~0.base_13 (store (select |v_#memory_$Pointer$.offset_58| v_my_callbackThread1of1ForFork1_~data~0.base_13) .cse0 (select (select |v_#memory_$Pointer$.offset_57| v_my_callbackThread1of1ForFork1_~data~0.base_13) .cse0))) |v_#memory_$Pointer$.offset_57|) (= (store |v_#memory_int_96| v_my_callbackThread1of1ForFork1_~data~0.base_13 (store (select |v_#memory_int_96| v_my_callbackThread1of1ForFork1_~data~0.base_13) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem30_9| 1))) |v_#memory_int_95|) (= (store |v_#memory_$Pointer$.base_58| v_my_callbackThread1of1ForFork1_~data~0.base_13 (store (select |v_#memory_$Pointer$.base_58| v_my_callbackThread1of1ForFork1_~data~0.base_13) .cse0 (select (select |v_#memory_$Pointer$.base_57| v_my_callbackThread1of1ForFork1_~data~0.base_13) .cse0))) |v_#memory_$Pointer$.base_57|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_13, my_callbackThread1of1ForFork1_#t~mem30=|v_my_callbackThread1of1ForFork1_#t~mem30_9|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_13, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_58|, #memory_int=|v_#memory_int_96|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_58|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_13, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_10|, my_callbackThread1of1ForFork1_#t~mem30=|v_my_callbackThread1of1ForFork1_#t~mem30_8|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_13, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_57|, #memory_int=|v_#memory_int_95|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_57|} 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 23:08:58,274 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_14|) (= |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_14|, 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 23:08:58,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [489] [489] L1737-3-->L1722: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8| |v_ULTIMATE.start_main_~#data~1.offset_49|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_23| 0)) (= (select (select |v_#memory_int_106| |v_~#t1~0.base_14|) |v_~#t1~0.offset_14|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem36_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8| v_ULTIMATE.start_my_drv_disconnect_~data.offset_8) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_23|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_20| 0) (= |v_ULTIMATE.start_main_#t~ret41_18| v_ULTIMATE.start_main_~probe_ret~0_19) (= |v_#length_34| (store |v_#length_35| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_23| 4)) (= v_ULTIMATE.start_my_drv_disconnect_~data.base_8 |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8|) (= 0 (select |v_#valid_61| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_23|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8| |v_ULTIMATE.start_main_~#data~1.base_54|) (= 0 v_ULTIMATE.start_main_~probe_ret~0_19) (= (store |v_#valid_61| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_23| 1) |v_#valid_60|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, ~#t1~0.base=|v_~#t1~0.base_14|, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_106|, ~#t1~0.offset=|v_~#t1~0.offset_14|, #length=|v_#length_35|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_49|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_54|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_8, ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset_12|, ULTIMATE.start_my_drv_disconnect_#in~data.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_8|, ULTIMATE.start_my_drv_disconnect_#t~mem36=|v_ULTIMATE.start_my_drv_disconnect_#t~mem36_13|, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_17|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.base_12|, ~#t1~0.offset=|v_~#t1~0.offset_14|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_20|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~#t1~0.base=|v_~#t1~0.base_14|, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_8, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_23|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset_13|, #valid=|v_#valid_60|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.base_13|, #memory_int=|v_#memory_int_106|, #length=|v_#length_34|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_49|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_19, ULTIMATE.start_my_drv_disconnect_#in~data.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data.base_8|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_54|} 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 23:08:58,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [450] [450] L1722-2-->L1723-1: Formula: (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem38_11| (select (select |v_#memory_int_70| |v_~#t2~0.base_10|) |v_~#t2~0.offset_10|)) InVars {~#t2~0.offset=|v_~#t2~0.offset_10|, #memory_int=|v_#memory_int_70|, ~#t2~0.base=|v_~#t2~0.base_10|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.offset_10|, ULTIMATE.start_my_drv_disconnect_#t~mem36=|v_ULTIMATE.start_my_drv_disconnect_#t~mem36_10|, ~#t2~0.offset=|v_~#t2~0.offset_10|, ULTIMATE.start_my_drv_disconnect_#t~nondet37.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet37.base_10|, #memory_int=|v_#memory_int_70|, ~#t2~0.base=|v_~#t2~0.base_10|} 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 23:08:58,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [508] [508] L1723-3-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_127| |v_ULTIMATE.start_main_~#data~1.base_70|))) (and (not (= |v_ULTIMATE.start_main_#t~mem43_27| 2)) (= |v_#valid_78| (store |v_#valid_79| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_27| 0)) (= |v_ULTIMATE.start_main_#t~mem43_27| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1.offset_65| 28))) (= v_ULTIMATE.start_ldv_assert_~expression_104 |v_ULTIMATE.start_ldv_assert_#in~expression_77|) (= 0 v_ULTIMATE.start_ldv_assert_~expression_104) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1.offset_65| 24)) 1))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_27|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_127|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_65|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_70|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem38=|v_ULTIMATE.start_my_drv_disconnect_#t~mem38_15|, 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_77|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_104, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_23|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_26|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.offset_14|, #valid=|v_#valid_78|, ULTIMATE.start_my_drv_disconnect_#t~nondet39.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet39.base_14|, #memory_int=|v_#memory_int_127|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_65|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_70|} 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 23:08:58,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:08:58 BasicIcfg [2019-12-27 23:08:58,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:08:58,334 INFO L168 Benchmark]: Toolchain (without parser) took 24267.34 ms. Allocated memory was 144.7 MB in the beginning and 375.9 MB in the end (delta: 231.2 MB). Free memory was 98.9 MB in the beginning and 192.8 MB in the end (delta: -93.8 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:58,335 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 23:08:58,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1598.55 ms. Allocated memory was 144.7 MB in the beginning and 235.4 MB in the end (delta: 90.7 MB). Free memory was 98.7 MB in the beginning and 169.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:58,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.82 ms. Allocated memory is still 235.4 MB. Free memory was 169.8 MB in the beginning and 166.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:58,337 INFO L168 Benchmark]: Boogie Preprocessor took 82.02 ms. Allocated memory is still 235.4 MB. Free memory was 166.9 MB in the beginning and 163.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:58,338 INFO L168 Benchmark]: RCFGBuilder took 997.02 ms. Allocated memory is still 235.4 MB. Free memory was 163.9 MB in the beginning and 116.0 MB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:58,339 INFO L168 Benchmark]: TraceAbstraction took 21425.60 ms. Allocated memory was 235.4 MB in the beginning and 375.9 MB in the end (delta: 140.5 MB). Free memory was 116.0 MB in the beginning and 192.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:58,343 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1598.55 ms. Allocated memory was 144.7 MB in the beginning and 235.4 MB in the end (delta: 90.7 MB). Free memory was 98.7 MB in the beginning and 169.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 157.82 ms. Allocated memory is still 235.4 MB. Free memory was 169.8 MB in the beginning and 166.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.02 ms. Allocated memory is still 235.4 MB. Free memory was 166.9 MB in the beginning and 163.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 997.02 ms. Allocated memory is still 235.4 MB. Free memory was 163.9 MB in the beginning and 116.0 MB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21425.60 ms. Allocated memory was 235.4 MB in the beginning and 375.9 MB in the end (delta: 140.5 MB). Free memory was 116.0 MB in the beginning and 192.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 11.4s, 144 ProgramPointsBefore, 36 ProgramPointsAfterwards, 148 TransitionsBefore, 35 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 15 ConcurrentYvCompositions, 6 ChoiceCompositions, 995 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.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={6:24}, t1={7:0}, t2={5:0}] [L1700] 1 data->shared.b VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={7:0}, t2={5:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={7:0}, t2={5:0}] [L1700] 2 data->shared.b VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={7:0}, t2={5:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={7:0}, t2={5:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={7:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Result: UNSAFE, OverallTime: 21.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 231 SDtfs, 319 SDslu, 585 SDs, 0 SdLazy, 1591 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.5s 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, 10 MinimizatonAttempts, 257 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 33527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...