/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:12:54,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:12:54,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:12:54,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:12:54,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:12:54,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:12:54,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:12:54,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:12:54,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:12:54,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:12:54,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:12:54,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:12:54,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:12:54,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:12:54,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:12:54,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:12:54,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:12:54,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:12:54,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:12:54,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:12:54,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:12:54,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:12:54,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:12:54,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:12:54,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:12:54,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:12:54,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:12:54,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:12:54,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:12:54,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:12:54,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:12:54,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:12:54,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:12:54,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:12:54,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:12:54,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:12:54,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:12:54,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:12:54,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:12:54,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:12:54,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:12:54,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-08-21 17:12:54,125 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:12:54,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:12:54,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:12:54,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:12:54,128 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:12:54,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:12:54,128 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:12:54,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:12:54,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:12:54,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:12:54,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:12:54,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:12:54,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:12:54,129 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:12:54,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:12:54,130 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:12:54,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:12:54,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:12:54,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:12:54,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:12:54,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:12:54,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:12:54,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:12:54,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-21 17:12:54,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:12:54,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:12:54,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:12:54,420 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:12:54,427 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:12:54,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2021-08-21 17:12:54,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2590b3700/1692178bdf0149399d6a766a027e44bb/FLAGa3d01095f [2021-08-21 17:12:54,990 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:12:54,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2021-08-21 17:12:55,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2590b3700/1692178bdf0149399d6a766a027e44bb/FLAGa3d01095f [2021-08-21 17:12:55,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2590b3700/1692178bdf0149399d6a766a027e44bb [2021-08-21 17:12:55,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:12:55,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:12:55,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:12:55,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:12:55,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:12:55,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d49bfc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55, skipping insertion in model container [2021-08-21 17:12:55,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:12:55,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:12:55,383 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 17:12:55,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[75002,75015] [2021-08-21 17:12:55,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:12:55,838 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:12:55,844 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 17:12:55,876 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[75002,75015] [2021-08-21 17:12:55,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:12:55,981 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:12:55,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55 WrapperNode [2021-08-21 17:12:55,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:12:55,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:12:55,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:12:55,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:12:55,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:12:56,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:12:56,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:12:56,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:12:56,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:12:56,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:12:56,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:12:56,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:12:56,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:56,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:12:56,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:12:56,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 17:12:56,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 17:12:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 17:12:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:12:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 17:12:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-21 17:12:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-21 17:12:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:12:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:12:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-08-21 17:12:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-08-21 17:12:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:12:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:12:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:12:56,137 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:12:56,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:12:56,642 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2021-08-21 17:12:56,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:12:56 BoogieIcfgContainer [2021-08-21 17:12:56,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:12:56,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:12:56,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:12:56,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:12:56,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:12:55" (1/3) ... [2021-08-21 17:12:56,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34efc9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:12:56, skipping insertion in model container [2021-08-21 17:12:56,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (2/3) ... [2021-08-21 17:12:56,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34efc9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:12:56, skipping insertion in model container [2021-08-21 17:12:56,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:12:56" (3/3) ... [2021-08-21 17:12:56,648 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2021-08-21 17:12:56,652 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:12:56,652 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:12:56,652 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-08-21 17:12:56,652 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:12:56,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,673 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,673 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,673 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,682 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,683 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,684 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,686 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,686 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,686 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,686 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,686 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,686 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,687 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,689 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,689 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,690 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,695 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-21 17:12:56,721 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:12:56,725 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:12:56,726 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 17:13:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 5052 states, 4607 states have (on average 1.5055350553505535) internal successors, (6936), 5051 states have internal predecessors, (6936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-21 17:13:55,666 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:55,667 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:55,667 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:13:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1601756939, now seen corresponding path program 1 times [2021-08-21 17:13:55,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:55,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849482809] [2021-08-21 17:13:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:55,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:56,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:56,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849482809] [2021-08-21 17:13:56,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849482809] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:56,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:56,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:13:56,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553188570] [2021-08-21 17:13:56,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:13:56,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:13:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:13:56,301 INFO L87 Difference]: Start difference. First operand has 5052 states, 4607 states have (on average 1.5055350553505535) internal successors, (6936), 5051 states have internal predecessors, (6936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:56,722 INFO L93 Difference]: Finished difference Result 6778 states and 9525 transitions. [2021-08-21 17:13:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 17:13:56,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-21 17:13:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:56,756 INFO L225 Difference]: With dead ends: 6778 [2021-08-21 17:13:56,757 INFO L226 Difference]: Without dead ends: 3450 [2021-08-21 17:13:56,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 106.1ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:13:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2021-08-21 17:13:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2424. [2021-08-21 17:13:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2399 states have (on average 1.523551479783243) internal successors, (3655), 2423 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 3655 transitions. [2021-08-21 17:13:56,876 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 3655 transitions. Word has length 48 [2021-08-21 17:13:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:56,877 INFO L470 AbstractCegarLoop]: Abstraction has 2424 states and 3655 transitions. [2021-08-21 17:13:56,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 3655 transitions. [2021-08-21 17:13:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-21 17:13:56,881 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:56,882 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:56,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:13:56,882 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:13:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash 350998619, now seen corresponding path program 1 times [2021-08-21 17:13:56,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:56,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037075939] [2021-08-21 17:13:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:56,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:57,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:57,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037075939] [2021-08-21 17:13:57,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037075939] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:57,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:57,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:13:57,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768434675] [2021-08-21 17:13:57,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:13:57,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:13:57,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:13:57,041 INFO L87 Difference]: Start difference. First operand 2424 states and 3655 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:57,247 INFO L93 Difference]: Finished difference Result 3700 states and 5769 transitions. [2021-08-21 17:13:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:13:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-08-21 17:13:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:57,256 INFO L225 Difference]: With dead ends: 3700 [2021-08-21 17:13:57,257 INFO L226 Difference]: Without dead ends: 2960 [2021-08-21 17:13:57,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:13:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2021-08-21 17:13:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2515. [2021-08-21 17:13:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2491 states have (on average 1.6655961461260538) internal successors, (4149), 2514 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 4149 transitions. [2021-08-21 17:13:57,341 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 4149 transitions. Word has length 54 [2021-08-21 17:13:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:57,341 INFO L470 AbstractCegarLoop]: Abstraction has 2515 states and 4149 transitions. [2021-08-21 17:13:57,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 4149 transitions. [2021-08-21 17:13:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-21 17:13:57,352 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:57,352 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:57,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:13:57,352 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:13:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash 392528972, now seen corresponding path program 1 times [2021-08-21 17:13:57,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:57,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777185786] [2021-08-21 17:13:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:57,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:57,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:57,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777185786] [2021-08-21 17:13:57,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777185786] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:57,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:57,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-21 17:13:57,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263924766] [2021-08-21 17:13:57,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-21 17:13:57,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-21 17:13:57,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-21 17:13:57,468 INFO L87 Difference]: Start difference. First operand 2515 states and 4149 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:57,497 INFO L93 Difference]: Finished difference Result 423 states and 556 transitions. [2021-08-21 17:13:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-21 17:13:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-08-21 17:13:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:57,499 INFO L225 Difference]: With dead ends: 423 [2021-08-21 17:13:57,499 INFO L226 Difference]: Without dead ends: 423 [2021-08-21 17:13:57,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:13:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-08-21 17:13:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2021-08-21 17:13:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 421 states have (on average 1.3206650831353919) internal successors, (556), 422 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 556 transitions. [2021-08-21 17:13:57,506 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 556 transitions. Word has length 66 [2021-08-21 17:13:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:57,507 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 556 transitions. [2021-08-21 17:13:57,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 556 transitions. [2021-08-21 17:13:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:13:57,509 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:57,509 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:57,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:13:57,509 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:13:57,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash 945732969, now seen corresponding path program 1 times [2021-08-21 17:13:57,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:57,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676432202] [2021-08-21 17:13:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:57,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:58,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:58,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676432202] [2021-08-21 17:13:58,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676432202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:58,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:58,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 17:13:58,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765343222] [2021-08-21 17:13:58,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 17:13:58,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 17:13:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:13:58,216 INFO L87 Difference]: Start difference. First operand 423 states and 556 transitions. Second operand has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:59,183 INFO L93 Difference]: Finished difference Result 486 states and 638 transitions. [2021-08-21 17:13:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-21 17:13:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:13:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:59,185 INFO L225 Difference]: With dead ends: 486 [2021-08-21 17:13:59,185 INFO L226 Difference]: Without dead ends: 486 [2021-08-21 17:13:59,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 899.7ms TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:13:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-08-21 17:13:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 478. [2021-08-21 17:13:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 476 states have (on average 1.3256302521008403) internal successors, (631), 477 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 631 transitions. [2021-08-21 17:13:59,192 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 631 transitions. Word has length 94 [2021-08-21 17:13:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:59,192 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 631 transitions. [2021-08-21 17:13:59,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 631 transitions. [2021-08-21 17:13:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:13:59,193 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:59,193 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:59,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:13:59,194 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:13:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:59,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1295164779, now seen corresponding path program 2 times [2021-08-21 17:13:59,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:59,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487889377] [2021-08-21 17:13:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:59,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:00,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:00,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487889377] [2021-08-21 17:14:00,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487889377] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:00,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:00,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-21 17:14:00,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140634495] [2021-08-21 17:14:00,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-21 17:14:00,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:00,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-21 17:14:00,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-08-21 17:14:00,053 INFO L87 Difference]: Start difference. First operand 478 states and 631 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:02,559 INFO L93 Difference]: Finished difference Result 873 states and 1243 transitions. [2021-08-21 17:14:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-21 17:14:02,559 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:02,561 INFO L225 Difference]: With dead ends: 873 [2021-08-21 17:14:02,561 INFO L226 Difference]: Without dead ends: 873 [2021-08-21 17:14:02,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2391.3ms TimeCoverageRelationStatistics Valid=468, Invalid=1424, Unknown=0, NotChecked=0, Total=1892 [2021-08-21 17:14:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2021-08-21 17:14:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 546. [2021-08-21 17:14:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4099264705882353) internal successors, (767), 545 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 767 transitions. [2021-08-21 17:14:02,582 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 767 transitions. Word has length 94 [2021-08-21 17:14:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:02,583 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 767 transitions. [2021-08-21 17:14:02,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 767 transitions. [2021-08-21 17:14:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:14:02,609 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:02,609 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:02,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:14:02,612 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1754433687, now seen corresponding path program 3 times [2021-08-21 17:14:02,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:02,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552369842] [2021-08-21 17:14:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:02,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:03,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:03,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552369842] [2021-08-21 17:14:03,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552369842] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:03,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:03,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 17:14:03,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759288877] [2021-08-21 17:14:03,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 17:14:03,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:03,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 17:14:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:14:03,292 INFO L87 Difference]: Start difference. First operand 546 states and 767 transitions. Second operand has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:04,215 INFO L93 Difference]: Finished difference Result 761 states and 1092 transitions. [2021-08-21 17:14:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-21 17:14:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:04,218 INFO L225 Difference]: With dead ends: 761 [2021-08-21 17:14:04,218 INFO L226 Difference]: Without dead ends: 761 [2021-08-21 17:14:04,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 875.8ms TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:14:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-08-21 17:14:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 546. [2021-08-21 17:14:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4099264705882353) internal successors, (767), 545 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 767 transitions. [2021-08-21 17:14:04,226 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 767 transitions. Word has length 94 [2021-08-21 17:14:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:04,226 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 767 transitions. [2021-08-21 17:14:04,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 767 transitions. [2021-08-21 17:14:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:14:04,227 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:04,227 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:04,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:14:04,228 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1847790305, now seen corresponding path program 4 times [2021-08-21 17:14:04,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:04,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116589126] [2021-08-21 17:14:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:04,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:05,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:05,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116589126] [2021-08-21 17:14:05,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116589126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:05,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:05,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-21 17:14:05,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677937619] [2021-08-21 17:14:05,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-21 17:14:05,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-21 17:14:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-08-21 17:14:05,068 INFO L87 Difference]: Start difference. First operand 546 states and 767 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:07,378 INFO L93 Difference]: Finished difference Result 709 states and 1014 transitions. [2021-08-21 17:14:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-21 17:14:07,379 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:07,382 INFO L225 Difference]: With dead ends: 709 [2021-08-21 17:14:07,382 INFO L226 Difference]: Without dead ends: 709 [2021-08-21 17:14:07,383 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2204.3ms TimeCoverageRelationStatistics Valid=449, Invalid=1621, Unknown=0, NotChecked=0, Total=2070 [2021-08-21 17:14:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-08-21 17:14:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 546. [2021-08-21 17:14:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4099264705882353) internal successors, (767), 545 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 767 transitions. [2021-08-21 17:14:07,390 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 767 transitions. Word has length 94 [2021-08-21 17:14:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:07,390 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 767 transitions. [2021-08-21 17:14:07,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 767 transitions. [2021-08-21 17:14:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:14:07,391 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:07,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:07,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:14:07,391 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:07,391 INFO L82 PathProgramCache]: Analyzing trace with hash -257168185, now seen corresponding path program 5 times [2021-08-21 17:14:07,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:07,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943883989] [2021-08-21 17:14:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:07,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:08,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:08,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943883989] [2021-08-21 17:14:08,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943883989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:08,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:08,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-21 17:14:08,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347267430] [2021-08-21 17:14:08,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-21 17:14:08,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:08,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-21 17:14:08,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2021-08-21 17:14:08,148 INFO L87 Difference]: Start difference. First operand 546 states and 767 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:10,363 INFO L93 Difference]: Finished difference Result 829 states and 1200 transitions. [2021-08-21 17:14:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-21 17:14:10,364 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:10,366 INFO L225 Difference]: With dead ends: 829 [2021-08-21 17:14:10,366 INFO L226 Difference]: Without dead ends: 829 [2021-08-21 17:14:10,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2115.8ms TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2021-08-21 17:14:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2021-08-21 17:14:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 546. [2021-08-21 17:14:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4099264705882353) internal successors, (767), 545 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 767 transitions. [2021-08-21 17:14:10,387 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 767 transitions. Word has length 94 [2021-08-21 17:14:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:10,387 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 767 transitions. [2021-08-21 17:14:10,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 767 transitions. [2021-08-21 17:14:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:14:10,388 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:10,388 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:10,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:14:10,389 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash 134800283, now seen corresponding path program 6 times [2021-08-21 17:14:10,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:10,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176051010] [2021-08-21 17:14:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:10,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:11,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:11,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176051010] [2021-08-21 17:14:11,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176051010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:11,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:11,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-21 17:14:11,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220393039] [2021-08-21 17:14:11,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-21 17:14:11,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:11,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-21 17:14:11,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2021-08-21 17:14:11,259 INFO L87 Difference]: Start difference. First operand 546 states and 767 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:13,599 INFO L93 Difference]: Finished difference Result 844 states and 1224 transitions. [2021-08-21 17:14:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-21 17:14:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:13,602 INFO L225 Difference]: With dead ends: 844 [2021-08-21 17:14:13,602 INFO L226 Difference]: Without dead ends: 844 [2021-08-21 17:14:13,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2208.7ms TimeCoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2021-08-21 17:14:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-08-21 17:14:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 546. [2021-08-21 17:14:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4099264705882353) internal successors, (767), 545 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 767 transitions. [2021-08-21 17:14:13,610 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 767 transitions. Word has length 94 [2021-08-21 17:14:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:13,610 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 767 transitions. [2021-08-21 17:14:13,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 767 transitions. [2021-08-21 17:14:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:14:13,611 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:13,611 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:13,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:14:13,612 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 19594429, now seen corresponding path program 7 times [2021-08-21 17:14:13,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:13,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962742684] [2021-08-21 17:14:13,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:13,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:14,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:14,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962742684] [2021-08-21 17:14:14,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962742684] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:14,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:14,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-21 17:14:14,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682984827] [2021-08-21 17:14:14,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-21 17:14:14,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-21 17:14:14,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2021-08-21 17:14:14,756 INFO L87 Difference]: Start difference. First operand 546 states and 767 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:17,129 INFO L93 Difference]: Finished difference Result 859 states and 1248 transitions. [2021-08-21 17:14:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-21 17:14:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:17,132 INFO L225 Difference]: With dead ends: 859 [2021-08-21 17:14:17,132 INFO L226 Difference]: Without dead ends: 859 [2021-08-21 17:14:17,132 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2368.2ms TimeCoverageRelationStatistics Valid=458, Invalid=1612, Unknown=0, NotChecked=0, Total=2070 [2021-08-21 17:14:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-08-21 17:14:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 546. [2021-08-21 17:14:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4099264705882353) internal successors, (767), 545 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 767 transitions. [2021-08-21 17:14:17,140 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 767 transitions. Word has length 94 [2021-08-21 17:14:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:17,140 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 767 transitions. [2021-08-21 17:14:17,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 767 transitions. [2021-08-21 17:14:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:14:17,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:17,141 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:17,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:14:17,142 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1312808317, now seen corresponding path program 8 times [2021-08-21 17:14:17,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:17,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195036647] [2021-08-21 17:14:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:17,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:17,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:17,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195036647] [2021-08-21 17:14:17,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195036647] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:17,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:17,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-21 17:14:17,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753318830] [2021-08-21 17:14:17,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-21 17:14:17,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:17,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-21 17:14:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2021-08-21 17:14:17,990 INFO L87 Difference]: Start difference. First operand 546 states and 767 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:19,897 INFO L93 Difference]: Finished difference Result 869 states and 1265 transitions. [2021-08-21 17:14:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-21 17:14:19,898 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:19,900 INFO L225 Difference]: With dead ends: 869 [2021-08-21 17:14:19,900 INFO L226 Difference]: Without dead ends: 869 [2021-08-21 17:14:19,901 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1793.2ms TimeCoverageRelationStatistics Valid=460, Invalid=1610, Unknown=0, NotChecked=0, Total=2070 [2021-08-21 17:14:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2021-08-21 17:14:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 546. [2021-08-21 17:14:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4099264705882353) internal successors, (767), 545 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 767 transitions. [2021-08-21 17:14:19,908 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 767 transitions. Word has length 94 [2021-08-21 17:14:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:19,908 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 767 transitions. [2021-08-21 17:14:19,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 767 transitions. [2021-08-21 17:14:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-21 17:14:19,909 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:19,909 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:19,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:14:19,909 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 694601051, now seen corresponding path program 9 times [2021-08-21 17:14:19,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:19,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107034317] [2021-08-21 17:14:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:19,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:20,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:20,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107034317] [2021-08-21 17:14:20,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107034317] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:20,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:20,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-21 17:14:20,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329163937] [2021-08-21 17:14:20,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-21 17:14:20,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:20,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-21 17:14:20,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-08-21 17:14:20,665 INFO L87 Difference]: Start difference. First operand 546 states and 767 transitions. Second operand has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:23,536 INFO L93 Difference]: Finished difference Result 801 states and 1161 transitions. [2021-08-21 17:14:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-21 17:14:23,537 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-21 17:14:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:23,539 INFO L225 Difference]: With dead ends: 801 [2021-08-21 17:14:23,539 INFO L226 Difference]: Without dead ends: 801 [2021-08-21 17:14:23,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2724.1ms TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2021-08-21 17:14:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-08-21 17:14:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 421. [2021-08-21 17:14:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.319047619047619) internal successors, (554), 420 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 554 transitions. [2021-08-21 17:14:23,545 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 554 transitions. Word has length 94 [2021-08-21 17:14:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:23,545 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 554 transitions. [2021-08-21 17:14:23,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.76) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 554 transitions. [2021-08-21 17:14:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-21 17:14:23,546 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:23,546 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:23,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:14:23,560 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash 843563861, now seen corresponding path program 1 times [2021-08-21 17:14:23,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:23,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243218894] [2021-08-21 17:14:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:23,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:24,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:24,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243218894] [2021-08-21 17:14:24,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243218894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:24,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:24,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-08-21 17:14:24,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491816180] [2021-08-21 17:14:24,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-21 17:14:24,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-21 17:14:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2021-08-21 17:14:24,755 INFO L87 Difference]: Start difference. First operand 421 states and 554 transitions. Second operand has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:27,704 INFO L93 Difference]: Finished difference Result 644 states and 885 transitions. [2021-08-21 17:14:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-21 17:14:27,705 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-21 17:14:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:27,706 INFO L225 Difference]: With dead ends: 644 [2021-08-21 17:14:27,706 INFO L226 Difference]: Without dead ends: 557 [2021-08-21 17:14:27,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2739.8ms TimeCoverageRelationStatistics Valid=542, Invalid=2880, Unknown=0, NotChecked=0, Total=3422 [2021-08-21 17:14:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-08-21 17:14:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 445. [2021-08-21 17:14:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.3288288288288288) internal successors, (590), 444 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 590 transitions. [2021-08-21 17:14:27,712 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 590 transitions. Word has length 100 [2021-08-21 17:14:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:27,712 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 590 transitions. [2021-08-21 17:14:27,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 590 transitions. [2021-08-21 17:14:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-21 17:14:27,713 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:27,713 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:27,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:14:27,714 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash -882653957, now seen corresponding path program 2 times [2021-08-21 17:14:27,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:27,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458935649] [2021-08-21 17:14:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:27,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:28,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:28,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458935649] [2021-08-21 17:14:28,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458935649] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:28,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:28,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-08-21 17:14:28,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162205613] [2021-08-21 17:14:28,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-21 17:14:28,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-21 17:14:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2021-08-21 17:14:28,856 INFO L87 Difference]: Start difference. First operand 445 states and 590 transitions. Second operand has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:32,770 INFO L93 Difference]: Finished difference Result 777 states and 1069 transitions. [2021-08-21 17:14:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:14:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-21 17:14:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:32,772 INFO L225 Difference]: With dead ends: 777 [2021-08-21 17:14:32,772 INFO L226 Difference]: Without dead ends: 703 [2021-08-21 17:14:32,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 3666.1ms TimeCoverageRelationStatistics Valid=694, Invalid=3466, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:14:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-08-21 17:14:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 447. [2021-08-21 17:14:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.3318385650224216) internal successors, (594), 446 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 594 transitions. [2021-08-21 17:14:32,779 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 594 transitions. Word has length 100 [2021-08-21 17:14:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:32,779 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 594 transitions. [2021-08-21 17:14:32,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 594 transitions. [2021-08-21 17:14:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-21 17:14:32,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:32,780 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:32,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 17:14:32,781 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash -184796389, now seen corresponding path program 3 times [2021-08-21 17:14:32,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:32,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270807709] [2021-08-21 17:14:32,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:32,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:34,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:34,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270807709] [2021-08-21 17:14:34,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270807709] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:34,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:34,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:14:34,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23029349] [2021-08-21 17:14:34,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:14:34,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:14:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:14:34,294 INFO L87 Difference]: Start difference. First operand 447 states and 594 transitions. Second operand has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:38,673 INFO L93 Difference]: Finished difference Result 774 states and 1065 transitions. [2021-08-21 17:14:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-21 17:14:38,673 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-21 17:14:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:38,675 INFO L225 Difference]: With dead ends: 774 [2021-08-21 17:14:38,675 INFO L226 Difference]: Without dead ends: 701 [2021-08-21 17:14:38,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4195.9ms TimeCoverageRelationStatistics Valid=788, Invalid=4042, Unknown=0, NotChecked=0, Total=4830 [2021-08-21 17:14:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-08-21 17:14:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 449. [2021-08-21 17:14:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.3303571428571428) internal successors, (596), 448 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 596 transitions. [2021-08-21 17:14:38,682 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 596 transitions. Word has length 100 [2021-08-21 17:14:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:38,682 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 596 transitions. [2021-08-21 17:14:38,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 596 transitions. [2021-08-21 17:14:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-21 17:14:38,683 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:38,683 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:38,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 17:14:38,683 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:38,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash 221580025, now seen corresponding path program 4 times [2021-08-21 17:14:38,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:38,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349150877] [2021-08-21 17:14:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:38,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:40,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:40,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349150877] [2021-08-21 17:14:40,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349150877] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:40,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:40,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:14:40,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980084977] [2021-08-21 17:14:40,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:14:40,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:40,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:14:40,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:14:40,190 INFO L87 Difference]: Start difference. First operand 449 states and 596 transitions. Second operand has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:45,103 INFO L93 Difference]: Finished difference Result 771 states and 1060 transitions. [2021-08-21 17:14:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-21 17:14:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-21 17:14:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:45,105 INFO L225 Difference]: With dead ends: 771 [2021-08-21 17:14:45,105 INFO L226 Difference]: Without dead ends: 700 [2021-08-21 17:14:45,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 4771.8ms TimeCoverageRelationStatistics Valid=836, Invalid=4134, Unknown=0, NotChecked=0, Total=4970 [2021-08-21 17:14:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-08-21 17:14:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 450. [2021-08-21 17:14:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.329621380846325) internal successors, (597), 449 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 597 transitions. [2021-08-21 17:14:45,125 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 597 transitions. Word has length 100 [2021-08-21 17:14:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:45,125 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 597 transitions. [2021-08-21 17:14:45,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 597 transitions. [2021-08-21 17:14:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-21 17:14:45,126 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:45,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:45,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 17:14:45,126 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:45,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1816937153, now seen corresponding path program 5 times [2021-08-21 17:14:45,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:45,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559742316] [2021-08-21 17:14:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:45,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:46,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:46,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559742316] [2021-08-21 17:14:46,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559742316] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:46,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:46,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:14:46,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622027837] [2021-08-21 17:14:46,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:14:46,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:46,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:14:46,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:14:46,508 INFO L87 Difference]: Start difference. First operand 450 states and 597 transitions. Second operand has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:52,440 INFO L93 Difference]: Finished difference Result 752 states and 1030 transitions. [2021-08-21 17:14:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-21 17:14:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-21 17:14:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:52,442 INFO L225 Difference]: With dead ends: 752 [2021-08-21 17:14:52,442 INFO L226 Difference]: Without dead ends: 682 [2021-08-21 17:14:52,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 5517.2ms TimeCoverageRelationStatistics Valid=887, Invalid=4225, Unknown=0, NotChecked=0, Total=5112 [2021-08-21 17:14:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-08-21 17:14:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 459. [2021-08-21 17:14:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.3253275109170306) internal successors, (607), 458 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 607 transitions. [2021-08-21 17:14:52,449 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 607 transitions. Word has length 100 [2021-08-21 17:14:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:52,449 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 607 transitions. [2021-08-21 17:14:52,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 607 transitions. [2021-08-21 17:14:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-21 17:14:52,450 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:52,450 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:52,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 17:14:52,450 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-21 17:14:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1304749793, now seen corresponding path program 6 times [2021-08-21 17:14:52,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:52,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455935342] [2021-08-21 17:14:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:52,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:14:52,472 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 17:14:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:14:52,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 17:14:52,519 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 17:14:52,520 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:52,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:52,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:52,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:52,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 17:14:52,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 17:14:52,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-21 17:14:52,525 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:14:52,525 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:14:52,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:14:52 BasicIcfg [2021-08-21 17:14:52,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:14:52,638 INFO L168 Benchmark]: Toolchain (without parser) took 117375.60 ms. Allocated memory was 168.8 MB in the beginning and 676.3 MB in the end (delta: 507.5 MB). Free memory was 130.0 MB in the beginning and 318.5 MB in the end (delta: -188.6 MB). Peak memory consumption was 320.0 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:52,639 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 168.8 MB. Free memory is still 149.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:14:52,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.84 ms. Allocated memory is still 168.8 MB. Free memory was 129.8 MB in the beginning and 108.0 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:52,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.29 ms. Allocated memory is still 168.8 MB. Free memory was 108.0 MB in the beginning and 104.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:52,639 INFO L168 Benchmark]: Boogie Preprocessor took 47.85 ms. Allocated memory is still 168.8 MB. Free memory was 104.9 MB in the beginning and 102.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:52,639 INFO L168 Benchmark]: RCFGBuilder took 567.80 ms. Allocated memory is still 168.8 MB. Free memory was 102.3 MB in the beginning and 129.0 MB in the end (delta: -26.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:52,639 INFO L168 Benchmark]: TraceAbstraction took 115992.91 ms. Allocated memory was 168.8 MB in the beginning and 676.3 MB in the end (delta: 507.5 MB). Free memory was 128.4 MB in the beginning and 318.5 MB in the end (delta: -190.1 MB). Peak memory consumption was 316.9 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:52,640 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 168.8 MB. Free memory is still 149.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 718.84 ms. Allocated memory is still 168.8 MB. Free memory was 129.8 MB in the beginning and 108.0 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 44.29 ms. Allocated memory is still 168.8 MB. Free memory was 108.0 MB in the beginning and 104.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.85 ms. Allocated memory is still 168.8 MB. Free memory was 104.9 MB in the beginning and 102.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 567.80 ms. Allocated memory is still 168.8 MB. Free memory was 102.3 MB in the beginning and 129.0 MB in the end (delta: -26.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 115992.91 ms. Allocated memory was 168.8 MB in the beginning and 676.3 MB in the end (delta: 507.5 MB). Free memory was 128.4 MB in the beginning and 318.5 MB in the end (delta: -190.1 MB). Peak memory consumption was 316.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10420, positive: 9752, positive conditional: 9752, positive unconditional: 0, negative: 668, negative conditional: 668, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10260, positive: 9752, positive conditional: 0, positive unconditional: 9752, negative: 508, negative conditional: 0, negative unconditional: 508, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1182, positive: 1140, positive conditional: 0, positive unconditional: 1140, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1182, positive: 1140, positive conditional: 0, positive unconditional: 1140, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58511, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1490, negative conditional: 0, negative unconditional: 1490, unknown: 57021, unknown conditional: 0, unknown unconditional: 57021] ], Cache Queries: [ total: 10260, positive: 8612, positive conditional: 0, positive unconditional: 8612, negative: 466, negative conditional: 0, negative unconditional: 466, unknown: 1182, unknown conditional: 0, unknown unconditional: 1182] , Statistics on independence cache: Total cache size (in pairs): 1182, Positive cache size: 1140, Positive conditional cache size: 0, Positive unconditional cache size: 1140, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Independence queries for same thread: 160 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={7:0}, t2={8:0}] [L1725] 0 return 0; VAL [t1={7:0}, t2={8:0}] [L1731] 0 int ret = my_drv_init(); VAL [t1={7:0}, t2={8:0}] [L1732] COND TRUE 0 ret==0 VAL [t1={7:0}, t2={8:0}] [L1733] 0 int probe_ret; VAL [t1={7:0}, t2={8:0}] [L1734] 0 struct my_data data; VAL [t1={7:0}, t2={8:0}] [L1704] 0 struct device *d = &data->dev; VAL [t1={7:0}, t2={8:0}] [L1706] 0 data->shared.a = 0 VAL [t1={7:0}, t2={8:0}] [L1707] 0 data->shared.b = 0 VAL [t1={7:0}, t2={8:0}] [L1708] 0 int res = __VERIFIER_nondet_int(); VAL [t1={7:0}, t2={8:0}] [L1709] COND FALSE 0 !(\read(res)) VAL [t1={7:0}, t2={8:0}] [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={9:24}, t1={7:0}, t2={8:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={9:24}, t1={7:0}, t2={8:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={9:24}, arg={9:24}, dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 1 struct my_data *data; VAL [arg={9:24}, arg={9:24}, dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1713] 0 return 0; VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1735] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1736] COND TRUE 0 probe_ret==0 VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1719] 0 void *status; VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1690] 2 struct my_data *data; VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [__mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1720] 0 \read(t1) VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1738] 0 data.shared.a VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1739] 0 data.shared.b VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1675] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={9:24}, arg={9:24}, arg={9:24}, data={9:0}, dev={9:24}, lb=0, t1={7:0}, t2={8:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 115802.9ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 80.4ms, AutomataDifference: 41289.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 58910.8ms, PartialOrderReductionTime: 58898.9ms, HoareTripleCheckerStatistics: 2234 SDtfs, 12489 SDslu, 24686 SDs, 0 SdLazy, 15092 SolverSat, 1438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7575.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 54 SyntacticMatches, 20 SemanticMatches, 734 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5618 ImplicationChecksByTransitivity, 38666.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5052occurred in iteration=0, InterpolantAutomatonStates: 447, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 328.0ms AutomataMinimizationTime, 17 MinimizatonAttempts, 4874 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.8ms SsaConstructionTime, 496.9ms SatisfiabilityAnalysisTime, 14126.6ms InterpolantComputationTime, 1614 NumberOfCodeBlocks, 1614 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1497 ConstructedInterpolants, 0 QuantifiedInterpolants, 22939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2021-08-21 17:14:52,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...