/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-60655ea [2020-09-16 01:28:35,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-16 01:28:35,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-16 01:28:35,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-16 01:28:35,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-16 01:28:35,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-16 01:28:35,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-16 01:28:35,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-16 01:28:35,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-16 01:28:35,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-16 01:28:35,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-16 01:28:35,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-16 01:28:35,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-16 01:28:35,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-16 01:28:35,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-16 01:28:35,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-16 01:28:35,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-16 01:28:35,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-16 01:28:35,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-16 01:28:35,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-16 01:28:35,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-16 01:28:35,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-16 01:28:35,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-16 01:28:35,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-16 01:28:35,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-16 01:28:35,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-16 01:28:35,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-16 01:28:35,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-16 01:28:35,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-16 01:28:35,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-16 01:28:35,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-16 01:28:35,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-16 01:28:35,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-16 01:28:35,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-16 01:28:35,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-16 01:28:35,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-16 01:28:35,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-16 01:28:35,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-16 01:28:35,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-16 01:28:35,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-16 01:28:35,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-16 01:28:35,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-09-16 01:28:35,245 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-16 01:28:35,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-16 01:28:35,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-16 01:28:35,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-16 01:28:35,248 INFO L138 SettingsManager]: * Use SBE=true [2020-09-16 01:28:35,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-16 01:28:35,249 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-16 01:28:35,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-16 01:28:35,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-16 01:28:35,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-16 01:28:35,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-16 01:28:35,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-16 01:28:35,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-16 01:28:35,250 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-16 01:28:35,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-16 01:28:35,251 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-16 01:28:35,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-16 01:28:35,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-16 01:28:35,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-16 01:28:35,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-16 01:28:35,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-16 01:28:35,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-16 01:28:35,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-16 01:28:35,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-16 01:28:35,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-16 01:28:35,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-16 01:28:35,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-16 01:28:35,253 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-09-16 01:28:35,254 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-16 01:28:35,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-16 01:28:35,256 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-09-16 01:28:35,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-16 01:28:35,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-16 01:28:35,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-16 01:28:35,833 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-16 01:28:35,834 INFO L275 PluginConnector]: CDTParser initialized [2020-09-16 01:28:35,835 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-09-16 01:28:35,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/13a8694a7/7611a40536d94bdd8a6fb55a79267665/FLAGca2059d72 [2020-09-16 01:28:36,836 INFO L306 CDTParser]: Found 1 translation units. [2020-09-16 01:28:36,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-09-16 01:28:36,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/13a8694a7/7611a40536d94bdd8a6fb55a79267665/FLAGca2059d72 [2020-09-16 01:28:36,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/13a8694a7/7611a40536d94bdd8a6fb55a79267665 [2020-09-16 01:28:36,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-16 01:28:37,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-16 01:28:37,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-16 01:28:37,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-16 01:28:37,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-16 01:28:37,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:28:36" (1/1) ... [2020-09-16 01:28:37,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a36905c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:37, skipping insertion in model container [2020-09-16 01:28:37,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:28:36" (1/1) ... [2020-09-16 01:28:37,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-16 01:28:37,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-16 01:28:38,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-16 01:28:38,376 INFO L203 MainTranslator]: Completed pre-run [2020-09-16 01:28:38,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-16 01:28:38,972 INFO L208 MainTranslator]: Completed translation [2020-09-16 01:28:38,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38 WrapperNode [2020-09-16 01:28:38,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-16 01:28:38,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-16 01:28:38,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-16 01:28:38,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-16 01:28:38,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-16 01:28:39,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-16 01:28:39,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-16 01:28:39,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-16 01:28:39,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... [2020-09-16 01:28:39,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-16 01:28:39,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-16 01:28:39,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-16 01:28:39,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-16 01:28:39,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-16 01:28:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-16 01:28:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-16 01:28:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-16 01:28:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-16 01:28:39,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-16 01:28:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-16 01:28:39,288 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-16 01:28:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-16 01:28:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-16 01:28:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-16 01:28:39,292 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-16 01:28:40,120 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-16 01:28:40,120 INFO L295 CfgBuilder]: Removed 20 assume(true) statements. [2020-09-16 01:28:40,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:28:40 BoogieIcfgContainer [2020-09-16 01:28:40,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-16 01:28:40,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-16 01:28:40,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-16 01:28:40,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-16 01:28:40,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 01:28:36" (1/3) ... [2020-09-16 01:28:40,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13265742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:28:40, skipping insertion in model container [2020-09-16 01:28:40,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:28:38" (2/3) ... [2020-09-16 01:28:40,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13265742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:28:40, skipping insertion in model container [2020-09-16 01:28:40,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:28:40" (3/3) ... [2020-09-16 01:28:40,155 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2020-09-16 01:28:40,172 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-16 01:28:40,172 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-16 01:28:40,189 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-09-16 01:28:40,190 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-16 01:28:40,251 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,252 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,252 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,252 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,253 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,253 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,253 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,257 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,257 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,260 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,260 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,266 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,266 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,268 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,273 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,275 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,275 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,275 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,276 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,276 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,285 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,285 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,286 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,286 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,286 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,286 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,287 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-16 01:28:40,330 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-16 01:28:40,367 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-16 01:28:40,367 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-16 01:28:40,368 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-16 01:28:40,368 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-09-16 01:28:40,368 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-16 01:28:40,368 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-16 01:28:40,369 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-16 01:28:40,369 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-16 01:28:40,395 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 284 flow [2020-09-16 01:28:40,399 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-09-16 01:28:40,501 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-09-16 01:28:40,501 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-16 01:28:40,515 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-09-16 01:28:40,523 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-09-16 01:28:40,599 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-09-16 01:28:40,599 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-16 01:28:40,602 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-09-16 01:28:40,610 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2200 [2020-09-16 01:28:40,612 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-16 01:28:41,597 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:41,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:41,633 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:41,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:41,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:41,660 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-16 01:28:43,475 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:43,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:43,520 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:43,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:43,545 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:43,546 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-09-16 01:28:43,933 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-09-16 01:28:44,354 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-09-16 01:28:44,381 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:44,484 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-09-16 01:28:44,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:44,492 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:44,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:44,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-16 01:28:44,572 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-09-16 01:28:45,299 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-09-16 01:28:45,717 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-09-16 01:28:46,140 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-09-16 01:28:46,560 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-09-16 01:28:46,830 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-09-16 01:28:47,099 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-09-16 01:28:47,318 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-09-16 01:28:47,375 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2954 [2020-09-16 01:28:47,376 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2020-09-16 01:28:47,382 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-09-16 01:28:47,406 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 190 states. [2020-09-16 01:28:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-09-16 01:28:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-16 01:28:47,421 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:28:47,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-16 01:28:47,423 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:28:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:28:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash 14364445, now seen corresponding path program 1 times [2020-09-16 01:28:47,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:28:47,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121569335] [2020-09-16 01:28:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:28:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:28:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:28:48,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121569335] [2020-09-16 01:28:48,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:28:48,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-16 01:28:48,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114143617] [2020-09-16 01:28:48,029 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:28:48,033 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:28:48,053 INFO L274 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-09-16 01:28:48,054 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:28:48,057 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-16 01:28:48,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-16 01:28:48,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:28:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-16 01:28:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-16 01:28:48,083 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 3 states. [2020-09-16 01:28:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:28:48,262 INFO L93 Difference]: Finished difference Result 248 states and 560 transitions. [2020-09-16 01:28:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-16 01:28:48,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-16 01:28:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:28:48,289 INFO L225 Difference]: With dead ends: 248 [2020-09-16 01:28:48,290 INFO L226 Difference]: Without dead ends: 230 [2020-09-16 01:28:48,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-16 01:28:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-09-16 01:28:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-09-16 01:28:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-16 01:28:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-09-16 01:28:48,381 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-09-16 01:28:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:28:48,381 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-09-16 01:28:48,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-16 01:28:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-09-16 01:28:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-16 01:28:48,382 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:28:48,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-16 01:28:48,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-16 01:28:48,383 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:28:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:28:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash 445298819, now seen corresponding path program 1 times [2020-09-16 01:28:48,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:28:48,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757018532] [2020-09-16 01:28:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:28:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:28:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:28:48,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757018532] [2020-09-16 01:28:48,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:28:48,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-16 01:28:48,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17266831] [2020-09-16 01:28:48,607 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:28:48,608 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:28:48,610 INFO L274 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-09-16 01:28:48,610 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:28:48,610 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-16 01:28:48,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-16 01:28:48,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:28:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-16 01:28:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-16 01:28:48,614 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-09-16 01:28:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:28:48,776 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-09-16 01:28:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-16 01:28:48,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-16 01:28:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:28:48,781 INFO L225 Difference]: With dead ends: 243 [2020-09-16 01:28:48,782 INFO L226 Difference]: Without dead ends: 236 [2020-09-16 01:28:48,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-16 01:28:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-09-16 01:28:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-09-16 01:28:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-09-16 01:28:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-09-16 01:28:48,806 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-09-16 01:28:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:28:48,806 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-09-16 01:28:48,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-16 01:28:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-09-16 01:28:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-16 01:28:48,808 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:28:48,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:28:48,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-16 01:28:48,809 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:28:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:28:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1770707455, now seen corresponding path program 1 times [2020-09-16 01:28:48,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:28:48,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879925498] [2020-09-16 01:28:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:28:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:28:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:28:48,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879925498] [2020-09-16 01:28:48,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:28:48,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-16 01:28:48,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742025169] [2020-09-16 01:28:48,959 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:28:48,960 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:28:48,962 INFO L274 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-09-16 01:28:48,963 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:28:48,963 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-16 01:28:48,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-16 01:28:48,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:28:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-16 01:28:48,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-16 01:28:48,965 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-09-16 01:28:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:28:48,985 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-09-16 01:28:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-16 01:28:48,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-09-16 01:28:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:28:48,987 INFO L225 Difference]: With dead ends: 86 [2020-09-16 01:28:48,987 INFO L226 Difference]: Without dead ends: 86 [2020-09-16 01:28:48,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-16 01:28:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-16 01:28:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-09-16 01:28:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-16 01:28:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-09-16 01:28:48,994 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-09-16 01:28:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:28:48,995 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-09-16 01:28:48,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-16 01:28:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-09-16 01:28:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:28:48,997 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:28:48,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:28:48,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-16 01:28:48,997 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:28:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:28:48,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1268591532, now seen corresponding path program 1 times [2020-09-16 01:28:48,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:28:48,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072635761] [2020-09-16 01:28:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:28:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:28:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:28:49,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072635761] [2020-09-16 01:28:49,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:28:49,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-16 01:28:49,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [931934247] [2020-09-16 01:28:49,592 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:28:49,599 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:28:49,619 INFO L274 McrAutomatonBuilder]: Finished intersection with 26 states and 32 transitions. [2020-09-16 01:28:49,619 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:28:49,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-09-16 01:28:49,692 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:49,696 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:49,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:49,769 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:49,770 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:49,777 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:49,777 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:49,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:49,787 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:28:49,788 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_78| vanished before elimination [2020-09-16 01:28:49,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-09-16 01:28:49,790 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:108, output treesize:26 [2020-09-16 01:28:51,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-09-16 01:28:51,967 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:51,972 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:51,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:52,008 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:28:52,009 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:52,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:28:52,016 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:52,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:52,026 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:28:52,027 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_79| vanished before elimination [2020-09-16 01:28:52,028 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-09-16 01:28:52,029 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:29 [2020-09-16 01:28:54,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-09-16 01:28:54,170 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:54,170 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:54,181 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:54,182 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:54,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:54,216 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_80| vanished before elimination [2020-09-16 01:28:54,226 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:54,226 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:54,235 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:54,235 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:54,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:54,247 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_80| vanished before elimination [2020-09-16 01:28:54,249 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-09-16 01:28:54,250 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:135, output treesize:53 [2020-09-16 01:28:58,354 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-09-16 01:28:58,375 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:58,380 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:58,381 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:58,470 INFO L625 ElimStorePlain]: treesize reduction 26, result has 82.1 percent of original size [2020-09-16 01:28:58,471 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:28:58,487 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:58,488 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:58,506 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:28:58,507 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:28:58,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:28:58,531 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_81| vanished before elimination [2020-09-16 01:28:58,534 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2020-09-16 01:28:58,534 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:205, output treesize:77 [2020-09-16 01:29:04,673 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2020-09-16 01:29:04,693 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2128#(and (not (= |~#t2~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (not (= my_callbackThread1of1ForFork0_thidvar0 (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ v_prenex_1 28) (+ v_prenex_2 1))) |~#t2~0.base|) |~#t2~0.offset|)))) (= (select |#valid| |~#t2~0.base|) 1)), 2125#(and (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int) (my_callbackThread1of1ForFork1_~data~0.offset Int)) (not (= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |~#t2~0.base|) |~#t2~0.offset|) my_callbackThread1of1ForFork0_thidvar0))) (= (select |#valid| |~#t2~0.base|) 1)), 2126#(and (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int) (my_callbackThread1of1ForFork1_~data~0.offset Int) (|my_callbackThread1of1ForFork1_#in~arg.offset| Int)) (not (= (select (select (store |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |~#t2~0.base|) |~#t2~0.offset|) my_callbackThread1of1ForFork0_thidvar0))) (= (select |#valid| |~#t2~0.base|) 1)), 2127#(and (forall ((my_callbackThread1of1ForFork0_~data~0.offset Int) (|my_callbackThread1of1ForFork1_#t~mem30| Int) (|my_callbackThread1of1ForFork0_#t~mem30| Int) (my_callbackThread1of1ForFork1_~data~0.offset Int) (|my_callbackThread1of1ForFork1_#in~arg.offset| Int)) (not (= my_callbackThread1of1ForFork0_thidvar0 (select (select (store (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |~#t2~0.base|) |~#t2~0.offset|)))) (= (select |#valid| |~#t2~0.base|) 1))] [2020-09-16 01:29:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-16 01:29:04,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:29:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-16 01:29:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=208, Unknown=5, NotChecked=0, Total=272 [2020-09-16 01:29:04,696 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 17 states. [2020-09-16 01:29:09,226 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-09-16 01:29:13,525 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-09-16 01:29:17,634 WARN L193 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-09-16 01:29:21,419 WARN L193 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-09-16 01:29:25,821 WARN L193 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-09-16 01:29:30,065 WARN L193 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-09-16 01:29:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:29:30,210 INFO L93 Difference]: Finished difference Result 86 states and 166 transitions. [2020-09-16 01:29:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-16 01:29:30,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-09-16 01:29:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:29:30,212 INFO L225 Difference]: With dead ends: 86 [2020-09-16 01:29:30,212 INFO L226 Difference]: Without dead ends: 74 [2020-09-16 01:29:30,214 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=287, Invalid=638, Unknown=5, NotChecked=0, Total=930 [2020-09-16 01:29:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-16 01:29:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-09-16 01:29:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-09-16 01:29:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 145 transitions. [2020-09-16 01:29:30,220 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 145 transitions. Word has length 18 [2020-09-16 01:29:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:29:30,220 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 145 transitions. [2020-09-16 01:29:30,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-16 01:29:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 145 transitions. [2020-09-16 01:29:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:29:30,222 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:29:30,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:29:30,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-16 01:29:30,223 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:29:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:29:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219722, now seen corresponding path program 1 times [2020-09-16 01:29:30,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:29:30,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626246556] [2020-09-16 01:29:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:29:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:29:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:29:30,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626246556] [2020-09-16 01:29:30,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:29:30,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-16 01:29:30,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1095028577] [2020-09-16 01:29:30,789 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:29:30,797 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:29:30,810 INFO L274 McrAutomatonBuilder]: Finished intersection with 26 states and 32 transitions. [2020-09-16 01:29:30,811 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:29:30,831 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,837 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,841 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:30,874 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:30,882 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:30,882 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,889 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:30,890 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,895 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:30,896 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:30,913 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_82| vanished before elimination [2020-09-16 01:29:30,914 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:30,914 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:153, output treesize:30 [2020-09-16 01:29:30,986 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,990 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:30,996 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:31,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:31,035 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:31,040 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:31,045 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:31,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:31,056 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:31,057 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:31,057 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:31,058 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:132, output treesize:33 [2020-09-16 01:29:31,174 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-09-16 01:29:31,206 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:31,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:31,245 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:31,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:31,298 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:31,298 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:31,299 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:31,300 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:98, output treesize:57 [2020-09-16 01:29:33,304 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#data~1.offset| 0) (forall ((my_callbackThread1of1ForFork0_~data~0.offset Int) (|my_callbackThread1of1ForFork1_#t~mem30| Int) (|my_callbackThread1of1ForFork0_#t~mem30| Int) (my_callbackThread1of1ForFork0_~data~0.base Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |c_#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))))) (store .cse0 |c_my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select .cse0 |c_my_callbackThread1of1ForFork1_#in~arg.base|) |c_my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |c_my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1)))) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#data~1.base|) 1)) is different from false [2020-09-16 01:29:33,360 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2400#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int)) (= (select (select (store |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1)) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 2401#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (forall ((my_callbackThread1of1ForFork0_~data~0.offset Int) (|my_callbackThread1of1ForFork1_#t~mem30| Int) (|my_callbackThread1of1ForFork0_#t~mem30| Int) (my_callbackThread1of1ForFork0_~data~0.base Int)) (= (select (select (store (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1)) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 2399#(and (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int)) (= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1)) (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1))] [2020-09-16 01:29:33,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-16 01:29:33,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:29:33,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-16 01:29:33,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2020-09-16 01:29:33,362 INFO L87 Difference]: Start difference. First operand 74 states and 145 transitions. Second operand 11 states. [2020-09-16 01:29:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:29:33,833 INFO L93 Difference]: Finished difference Result 117 states and 209 transitions. [2020-09-16 01:29:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-16 01:29:33,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-09-16 01:29:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:29:33,836 INFO L225 Difference]: With dead ends: 117 [2020-09-16 01:29:33,836 INFO L226 Difference]: Without dead ends: 117 [2020-09-16 01:29:33,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=54, Invalid=105, Unknown=1, NotChecked=22, Total=182 [2020-09-16 01:29:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-09-16 01:29:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2020-09-16 01:29:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-16 01:29:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-09-16 01:29:33,856 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-09-16 01:29:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:29:33,856 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-09-16 01:29:33,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-16 01:29:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-09-16 01:29:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:29:33,861 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:29:33,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:29:33,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-16 01:29:33,862 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:29:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:29:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219740, now seen corresponding path program 1 times [2020-09-16 01:29:33,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:29:33,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081304501] [2020-09-16 01:29:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:29:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:29:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:29:35,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081304501] [2020-09-16 01:29:35,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:29:35,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-16 01:29:35,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561105792] [2020-09-16 01:29:35,074 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:29:35,077 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:29:35,088 INFO L274 McrAutomatonBuilder]: Finished intersection with 26 states and 32 transitions. [2020-09-16 01:29:35,088 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:29:35,098 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,103 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,107 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:35,144 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,148 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,151 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:35,170 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:35,170 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:35,170 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-16 01:29:35,171 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:153, output treesize:30 [2020-09-16 01:29:35,275 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,280 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,285 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:35,323 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,327 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,331 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:35,345 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:35,346 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:35,346 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-16 01:29:35,347 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:141, output treesize:42 [2020-09-16 01:29:35,417 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,422 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,430 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:35,486 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,491 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,496 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:35,512 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:35,512 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:35,512 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-16 01:29:35,513 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:201, output treesize:78 [2020-09-16 01:29:35,608 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,610 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,615 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,619 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,663 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,667 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,772 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2020-09-16 01:29:35,772 INFO L625 ElimStorePlain]: treesize reduction 134, result has 48.9 percent of original size [2020-09-16 01:29:35,782 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:35,783 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,790 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:35,791 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:35,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:35,818 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:35,818 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_89| vanished before elimination [2020-09-16 01:29:35,818 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-09-16 01:29:35,818 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:382, output treesize:86 [2020-09-16 01:29:36,154 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [2729#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 2730#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= 2 (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28))) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 2731#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (= 2 (select (select (store |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ (select (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)))), 2732#(and (= (select (select (store (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ (select (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2) (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 2733#(and (= (select (select (store (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ (select (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2) (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (+ |ULTIMATE.start_main_~#data~1.offset| 24) |my_callbackThread1of1ForFork1_#in~arg.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 2734#(and (= (select (select (store (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ (select (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2) (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 2735#(and (= (select (select (store (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ (select (store (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2) (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (+ |ULTIMATE.start_main_~#data~1.offset| 24) |my_callbackThread1of1ForFork1_#in~arg.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1))] [2020-09-16 01:29:36,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-16 01:29:36,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:29:36,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-16 01:29:36,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2020-09-16 01:29:36,156 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 21 states. [2020-09-16 01:29:37,335 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2020-09-16 01:29:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:29:38,892 INFO L93 Difference]: Finished difference Result 186 states and 344 transitions. [2020-09-16 01:29:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-16 01:29:38,893 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2020-09-16 01:29:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:29:38,895 INFO L225 Difference]: With dead ends: 186 [2020-09-16 01:29:38,896 INFO L226 Difference]: Without dead ends: 178 [2020-09-16 01:29:38,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2020-09-16 01:29:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-09-16 01:29:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 104. [2020-09-16 01:29:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-09-16 01:29:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 197 transitions. [2020-09-16 01:29:38,903 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 197 transitions. Word has length 18 [2020-09-16 01:29:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:29:38,903 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 197 transitions. [2020-09-16 01:29:38,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-16 01:29:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2020-09-16 01:29:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:29:38,905 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:29:38,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:29:38,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-16 01:29:38,906 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:29:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:29:38,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1046484834, now seen corresponding path program 2 times [2020-09-16 01:29:38,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:29:38,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534373519] [2020-09-16 01:29:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:29:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:29:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:29:40,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534373519] [2020-09-16 01:29:40,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:29:40,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-16 01:29:40,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995786467] [2020-09-16 01:29:40,073 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:29:40,077 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:29:40,087 INFO L274 McrAutomatonBuilder]: Finished intersection with 28 states and 36 transitions. [2020-09-16 01:29:40,088 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:29:40,121 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,121 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,130 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,131 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,137 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,138 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:40,170 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_90| vanished before elimination [2020-09-16 01:29:40,177 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,178 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,185 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,186 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,193 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,193 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:40,206 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_90| vanished before elimination [2020-09-16 01:29:40,206 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-16 01:29:40,206 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:152, output treesize:29 [2020-09-16 01:29:40,396 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-09-16 01:29:40,515 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,515 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,525 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,525 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,535 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,536 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,546 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,547 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,557 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,566 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,567 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:40,624 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_91| vanished before elimination [2020-09-16 01:29:40,633 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,636 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,644 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,645 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,653 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,653 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,665 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,665 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,678 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,679 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,686 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:40,687 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:40,708 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_91| vanished before elimination [2020-09-16 01:29:40,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-16 01:29:40,708 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:239, output treesize:41 [2020-09-16 01:29:40,749 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,753 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,760 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,764 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,771 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,776 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:40,840 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:40,850 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,850 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,863 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,864 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,878 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,878 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,886 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,887 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,895 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,896 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,908 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:40,908 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:40,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:40,940 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_92| vanished before elimination [2020-09-16 01:29:40,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-16 01:29:40,941 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:305, output treesize:59 [2020-09-16 01:29:41,101 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:41,105 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:41,107 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:41,109 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:41,111 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:41,113 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:41,189 INFO L625 ElimStorePlain]: treesize reduction 184, result has 24.3 percent of original size [2020-09-16 01:29:41,189 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:41,190 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:41,190 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_93| vanished before elimination [2020-09-16 01:29:41,190 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-16 01:29:41,191 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:363, output treesize:59 [2020-09-16 01:29:41,195 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3162#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2)), 3163#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= 2 (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)))), 3164#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.offset |ULTIMATE.start_main_~#data~1.offset|) (= 2 (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28))) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| my_callbackThread1of1ForFork1_~data~0.base))), 3165#(and (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1) (= (+ |ULTIMATE.start_main_~#data~1.offset| 24) |my_callbackThread1of1ForFork1_#in~arg.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (<= 1 (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)))), 3166#(and (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= 1 (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4))) (= (+ |ULTIMATE.start_main_~#data~1.offset| 24) |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1))] [2020-09-16 01:29:41,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-16 01:29:41,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:29:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-16 01:29:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2020-09-16 01:29:41,196 INFO L87 Difference]: Start difference. First operand 104 states and 197 transitions. Second operand 19 states. [2020-09-16 01:29:42,026 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-09-16 01:29:42,293 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-09-16 01:29:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:29:43,906 INFO L93 Difference]: Finished difference Result 181 states and 338 transitions. [2020-09-16 01:29:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-16 01:29:43,906 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2020-09-16 01:29:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:29:43,908 INFO L225 Difference]: With dead ends: 181 [2020-09-16 01:29:43,908 INFO L226 Difference]: Without dead ends: 163 [2020-09-16 01:29:43,909 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2020-09-16 01:29:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-09-16 01:29:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2020-09-16 01:29:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-16 01:29:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 189 transitions. [2020-09-16 01:29:43,916 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 189 transitions. Word has length 18 [2020-09-16 01:29:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:29:43,916 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 189 transitions. [2020-09-16 01:29:43,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-16 01:29:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 189 transitions. [2020-09-16 01:29:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:29:43,920 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:29:43,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:29:43,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-16 01:29:43,921 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:29:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:29:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 646402192, now seen corresponding path program 2 times [2020-09-16 01:29:43,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:29:43,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432684379] [2020-09-16 01:29:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:29:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:29:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:29:44,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432684379] [2020-09-16 01:29:44,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:29:44,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-16 01:29:44,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115680753] [2020-09-16 01:29:44,453 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:29:44,458 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:29:44,470 INFO L274 McrAutomatonBuilder]: Finished intersection with 26 states and 32 transitions. [2020-09-16 01:29:44,470 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:29:44,482 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,488 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,492 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:44,539 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,543 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,547 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:44,562 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:44,562 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:44,563 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:44,563 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:152, output treesize:29 [2020-09-16 01:29:44,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,717 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,722 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:44,776 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,782 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,786 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:44,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:44,802 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:44,802 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:44,803 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:44,804 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:131, output treesize:32 [2020-09-16 01:29:44,929 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3576#(and (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int)) (= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1)) (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|))), 3577#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int)) (= (select (select (store |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1)))] [2020-09-16 01:29:44,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-16 01:29:44,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:29:44,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-16 01:29:44,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-16 01:29:44,930 INFO L87 Difference]: Start difference. First operand 100 states and 189 transitions. Second operand 10 states. [2020-09-16 01:29:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:29:45,638 INFO L93 Difference]: Finished difference Result 123 states and 224 transitions. [2020-09-16 01:29:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-16 01:29:45,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-09-16 01:29:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:29:45,640 INFO L225 Difference]: With dead ends: 123 [2020-09-16 01:29:45,640 INFO L226 Difference]: Without dead ends: 123 [2020-09-16 01:29:45,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-09-16 01:29:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-16 01:29:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 100. [2020-09-16 01:29:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-16 01:29:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 189 transitions. [2020-09-16 01:29:45,650 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 189 transitions. Word has length 18 [2020-09-16 01:29:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:29:45,652 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 189 transitions. [2020-09-16 01:29:45,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-16 01:29:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 189 transitions. [2020-09-16 01:29:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:29:45,659 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:29:45,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:29:45,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-16 01:29:45,659 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:29:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:29:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 646402210, now seen corresponding path program 3 times [2020-09-16 01:29:45,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:29:45,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568779273] [2020-09-16 01:29:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:29:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:29:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:29:46,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568779273] [2020-09-16 01:29:46,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:29:46,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-16 01:29:46,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930859022] [2020-09-16 01:29:46,893 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:29:46,898 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:29:46,907 INFO L274 McrAutomatonBuilder]: Finished intersection with 26 states and 32 transitions. [2020-09-16 01:29:46,908 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:29:46,920 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:46,925 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:46,928 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:46,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:46,966 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:46,970 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:46,974 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:46,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:46,985 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:46,985 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:46,986 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-16 01:29:46,986 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:152, output treesize:29 [2020-09-16 01:29:47,051 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,057 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,062 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,067 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,075 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,081 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:47,148 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,153 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,158 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,162 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,176 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,180 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:47,200 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2020-09-16 01:29:47,200 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:47,200 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-16 01:29:47,201 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:305, output treesize:59 [2020-09-16 01:29:47,417 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-16 01:29:47,417 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,419 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-16 01:29:47,420 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,422 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-16 01:29:47,423 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,424 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-16 01:29:47,425 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,427 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-16 01:29:47,427 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,429 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-09-16 01:29:47,430 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:47,449 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:47,449 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_100| vanished before elimination [2020-09-16 01:29:47,449 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_100| vanished before elimination [2020-09-16 01:29:47,450 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-09-16 01:29:47,450 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:363, output treesize:59 [2020-09-16 01:29:47,463 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:47,464 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,473 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:47,473 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,483 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:47,483 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:47,536 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:47,537 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:47,545 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,551 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:47,551 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:47,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:47,565 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_101| vanished before elimination [2020-09-16 01:29:47,565 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_101| vanished before elimination [2020-09-16 01:29:47,565 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-09-16 01:29:47,566 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:140, output treesize:41 [2020-09-16 01:29:47,638 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3925#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)) 2)), 3926#(and (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1) (= (+ |ULTIMATE.start_main_~#data~1.offset| 24) |my_callbackThread1of1ForFork1_#in~arg.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (<= 1 (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)))), 3927#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= 2 (select (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28)))), 3928#(and (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= 1 (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4))) (= (+ |ULTIMATE.start_main_~#data~1.offset| 24) |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28)) 1))) |my_callbackThread1of1ForFork1_#in~arg.base|) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1)), 3929#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (not (= |ULTIMATE.start_my_drv_disconnect_~#status~0.base| |ULTIMATE.start_main_~#data~1.base|)) (= 2 (select (select (store |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ (select (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4)) 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 28))))] [2020-09-16 01:29:47,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-16 01:29:47,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:29:47,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-16 01:29:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-09-16 01:29:47,640 INFO L87 Difference]: Start difference. First operand 100 states and 189 transitions. Second operand 19 states. [2020-09-16 01:29:48,364 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-09-16 01:29:48,641 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-09-16 01:29:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:29:50,355 INFO L93 Difference]: Finished difference Result 190 states and 350 transitions. [2020-09-16 01:29:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-16 01:29:50,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2020-09-16 01:29:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:29:50,357 INFO L225 Difference]: With dead ends: 190 [2020-09-16 01:29:50,358 INFO L226 Difference]: Without dead ends: 168 [2020-09-16 01:29:50,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2020-09-16 01:29:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-09-16 01:29:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 96. [2020-09-16 01:29:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-16 01:29:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 181 transitions. [2020-09-16 01:29:50,368 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 181 transitions. Word has length 18 [2020-09-16 01:29:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:29:50,369 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 181 transitions. [2020-09-16 01:29:50,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-16 01:29:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 181 transitions. [2020-09-16 01:29:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:29:50,370 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:29:50,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:29:50,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-16 01:29:50,370 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:29:50,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:29:50,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440908, now seen corresponding path program 3 times [2020-09-16 01:29:50,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:29:50,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265990975] [2020-09-16 01:29:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:29:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-16 01:29:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-16 01:29:51,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265990975] [2020-09-16 01:29:51,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-16 01:29:51,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-16 01:29:51,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1510876758] [2020-09-16 01:29:51,206 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-16 01:29:51,210 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-16 01:29:51,219 INFO L274 McrAutomatonBuilder]: Finished intersection with 25 states and 30 transitions. [2020-09-16 01:29:51,219 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-16 01:29:51,237 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,237 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,245 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,246 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,252 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,252 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:51,285 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_102| vanished before elimination [2020-09-16 01:29:51,293 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,293 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,301 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,302 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,308 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,309 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:51,320 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_102| vanished before elimination [2020-09-16 01:29:51,321 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:51,321 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:153, output treesize:30 [2020-09-16 01:29:51,432 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,432 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,442 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,443 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,455 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,456 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:51,517 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_103| vanished before elimination [2020-09-16 01:29:51,527 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,528 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,540 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,540 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,550 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-09-16 01:29:51,551 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:51,570 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_103| vanished before elimination [2020-09-16 01:29:51,570 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:51,571 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:177, output treesize:54 [2020-09-16 01:29:51,707 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,714 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,721 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:51,781 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:51,781 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,792 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:51,792 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,800 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-09-16 01:29:51,801 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-16 01:29:51,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-16 01:29:51,821 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_104| vanished before elimination [2020-09-16 01:29:51,821 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-09-16 01:29:51,821 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-09-16 01:29:51,822 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:159, output treesize:60 [2020-09-16 01:29:51,999 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4341#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (forall ((|my_callbackThread1of1ForFork0_#t~mem30| Int)) (= (select (select (store |#memory_int| my_callbackThread1of1ForFork0_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1))), 4342#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int) (|my_callbackThread1of1ForFork0_#t~mem30| Int)) (= (select (select (store (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) my_callbackThread1of1ForFork0_~data~0.base (store (select (store |#memory_int| my_callbackThread1of1ForFork1_~data~0.base (store (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) (+ my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1))), 4343#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int) (|my_callbackThread1of1ForFork0_#t~mem30| Int)) (= (select (select (store (store |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) my_callbackThread1of1ForFork0_~data~0.base (store (select (store |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base| (store (store (select |#memory_int| |my_callbackThread1of1ForFork1_#in~arg.base|) |my_callbackThread1of1ForFork1_#in~arg.offset| 1) (+ |my_callbackThread1of1ForFork1_#in~arg.offset| 4) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))) my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))) |ULTIMATE.start_main_~#data~1.base|) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1)) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1))] [2020-09-16 01:29:51,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-16 01:29:52,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-16 01:29:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-16 01:29:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-09-16 01:29:52,000 INFO L87 Difference]: Start difference. First operand 96 states and 181 transitions. Second operand 14 states. [2020-09-16 01:29:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-16 01:29:52,836 INFO L93 Difference]: Finished difference Result 182 states and 324 transitions. [2020-09-16 01:29:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-16 01:29:52,837 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-16 01:29:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-16 01:29:52,838 INFO L225 Difference]: With dead ends: 182 [2020-09-16 01:29:52,838 INFO L226 Difference]: Without dead ends: 182 [2020-09-16 01:29:52,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-09-16 01:29:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-09-16 01:29:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 114. [2020-09-16 01:29:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-09-16 01:29:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 223 transitions. [2020-09-16 01:29:52,849 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 223 transitions. Word has length 18 [2020-09-16 01:29:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-16 01:29:52,849 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 223 transitions. [2020-09-16 01:29:52,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-16 01:29:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 223 transitions. [2020-09-16 01:29:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-16 01:29:52,852 INFO L414 BasicCegarLoop]: Found error trace [2020-09-16 01:29:52,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-16 01:29:52,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-16 01:29:52,853 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-16 01:29:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-16 01:29:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440926, now seen corresponding path program 4 times [2020-09-16 01:29:52,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-16 01:29:52,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432347937] [2020-09-16 01:29:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-16 01:29:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-16 01:29:52,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-16 01:29:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-16 01:29:52,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-16 01:29:53,035 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-16 01:29:53,036 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-16 01:29:53,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-16 01:29:53,037 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-16 01:29:53,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [392] [392] L1682-->L1739: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out974508389 |ULTIMATE.start_ldv_assert_#in~expression_In974508389|) (not (= ULTIMATE.start_ldv_assert_~expression_Out974508389 0))) InVars {ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In974508389|} OutVars{ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_Out974508389|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In974508389|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out974508389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem40, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-16 01:29:53,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 01:29:53 BasicIcfg [2020-09-16 01:29:53,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-16 01:29:53,120 INFO L168 Benchmark]: Toolchain (without parser) took 76123.20 ms. Allocated memory was 139.5 MB in the beginning and 449.8 MB in the end (delta: 310.4 MB). Free memory was 99.7 MB in the beginning and 309.7 MB in the end (delta: -210.1 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. [2020-09-16 01:29:53,121 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-09-16 01:29:53,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1971.06 ms. Allocated memory was 139.5 MB in the beginning and 237.0 MB in the end (delta: 97.5 MB). Free memory was 99.0 MB in the beginning and 171.9 MB in the end (delta: -72.9 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2020-09-16 01:29:53,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.12 ms. Allocated memory is still 237.0 MB. Free memory was 171.9 MB in the beginning and 168.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-16 01:29:53,122 INFO L168 Benchmark]: Boogie Preprocessor took 83.97 ms. Allocated memory is still 237.0 MB. Free memory was 168.9 MB in the beginning and 165.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-16 01:29:53,123 INFO L168 Benchmark]: RCFGBuilder took 971.60 ms. Allocated memory is still 237.0 MB. Free memory was 165.9 MB in the beginning and 120.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2020-09-16 01:29:53,123 INFO L168 Benchmark]: TraceAbstraction took 72977.34 ms. Allocated memory was 237.0 MB in the beginning and 449.8 MB in the end (delta: 212.9 MB). Free memory was 120.4 MB in the beginning and 309.7 MB in the end (delta: -189.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-09-16 01:29:53,126 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1971.06 ms. Allocated memory was 139.5 MB in the beginning and 237.0 MB in the end (delta: 97.5 MB). Free memory was 99.0 MB in the beginning and 171.9 MB in the end (delta: -72.9 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.12 ms. Allocated memory is still 237.0 MB. Free memory was 171.9 MB in the beginning and 168.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.97 ms. Allocated memory is still 237.0 MB. Free memory was 168.9 MB in the beginning and 165.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 971.60 ms. Allocated memory is still 237.0 MB. Free memory was 165.9 MB in the beginning and 120.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72977.34 ms. Allocated memory was 237.0 MB in the beginning and 449.8 MB in the end (delta: 212.9 MB). Free memory was 120.4 MB in the beginning and 309.7 MB in the end (delta: -189.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.9s, 129 ProgramPointsBefore, 34 ProgramPointsAfterwards, 131 TransitionsBefore, 32 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 1101 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2954 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1725] 0 return 0; [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, t1={5:0}, t2={7:0}] [L1696] 1 struct device *dev = (struct device*)arg; [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1700] 1 data->shared.b VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7:0}] [L1696] 2 struct device *dev = (struct device*)arg; [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1713] 0 return 0; [L1735] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1736] COND TRUE 0 probe_ret==0 [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1738] 0 data.shared.a [L1739] 0 data.shared.b [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 72.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 179 SDtfs, 464 SDslu, 555 SDs, 0 SdLazy, 2696 SolverSat, 329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 50.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=2, 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, 368 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 42418 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, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...