/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf -i ../sv-benchmarks/c/weaver/chl/time-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-06 21:11:10,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-06 21:11:10,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-06 21:11:10,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-06 21:11:10,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-06 21:11:10,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-06 21:11:10,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-06 21:11:10,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-06 21:11:10,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-06 21:11:10,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-06 21:11:10,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-06 21:11:10,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-06 21:11:10,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-06 21:11:10,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-06 21:11:10,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-06 21:11:10,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-06 21:11:10,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-06 21:11:10,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-06 21:11:10,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-06 21:11:10,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-06 21:11:10,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-06 21:11:10,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-06 21:11:10,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-06 21:11:10,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-06 21:11:10,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-06 21:11:10,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-06 21:11:10,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-06 21:11:10,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-06 21:11:10,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-06 21:11:10,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-06 21:11:10,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-06 21:11:10,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-06 21:11:10,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-06 21:11:10,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-06 21:11:10,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-06 21:11:10,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-06 21:11:10,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-06 21:11:10,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-06 21:11:10,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-06 21:11:10,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-06 21:11:10,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-06 21:11:10,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-10-06 21:11:10,393 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-06 21:11:10,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-06 21:11:10,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-06 21:11:10,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-06 21:11:10,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-06 21:11:10,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-06 21:11:10,398 INFO L138 SettingsManager]: * Use SBE=true [2021-10-06 21:11:10,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-06 21:11:10,399 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-06 21:11:10,399 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-06 21:11:10,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-06 21:11:10,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-06 21:11:10,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-06 21:11:10,401 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-06 21:11:10,401 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-06 21:11:10,401 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-06 21:11:10,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-06 21:11:10,402 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-06 21:11:10,402 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-06 21:11:10,402 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-06 21:11:10,402 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-06 21:11:10,403 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-06 21:11:10,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-06 21:11:10,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-06 21:11:10,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-06 21:11:10,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 21:11:10,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-06 21:11:10,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-06 21:11:10,405 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-06 21:11:10,405 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-06 21:11:10,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-06 21:11:10,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-06 21:11:10,406 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-2/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-10-06 21:11:10,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-06 21:11:10,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-06 21:11:10,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-06 21:11:10,881 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-06 21:11:10,882 INFO L275 PluginConnector]: CDTParser initialized [2021-10-06 21:11:10,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl/time-trans.wvr.c [2021-10-06 21:11:10,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/50630d7a7/b80537d0c6f14405aa8060fee340f77e/FLAG8b77151c0 [2021-10-06 21:11:11,641 INFO L306 CDTParser]: Found 1 translation units. [2021-10-06 21:11:11,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/time-trans.wvr.c [2021-10-06 21:11:11,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/50630d7a7/b80537d0c6f14405aa8060fee340f77e/FLAG8b77151c0 [2021-10-06 21:11:11,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/50630d7a7/b80537d0c6f14405aa8060fee340f77e [2021-10-06 21:11:11,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-06 21:11:11,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-06 21:11:12,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-06 21:11:12,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-06 21:11:12,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-06 21:11:12,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 09:11:11" (1/1) ... [2021-10-06 21:11:12,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1b5064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12, skipping insertion in model container [2021-10-06 21:11:12,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 09:11:11" (1/1) ... [2021-10-06 21:11:12,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-06 21:11:12,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-06 21:11:12,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/time-trans.wvr.c[2743,2756] [2021-10-06 21:11:12,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 21:11:12,246 INFO L203 MainTranslator]: Completed pre-run [2021-10-06 21:11:12,270 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/time-trans.wvr.c[2743,2756] [2021-10-06 21:11:12,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 21:11:12,291 INFO L208 MainTranslator]: Completed translation [2021-10-06 21:11:12,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12 WrapperNode [2021-10-06 21:11:12,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-06 21:11:12,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-06 21:11:12,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-06 21:11:12,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-06 21:11:12,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-06 21:11:12,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-06 21:11:12,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-06 21:11:12,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-06 21:11:12,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-06 21:11:12,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-06 21:11:12,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-06 21:11:12,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-06 21:11:12,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (1/1) ... [2021-10-06 21:11:12,403 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 21:11:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 21:11:12,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-06 21:11:12,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-06 21:11:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-06 21:11:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-06 21:11:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-06 21:11:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-06 21:11:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-06 21:11:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-06 21:11:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-06 21:11:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-06 21:11:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-06 21:11:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-06 21:11:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-06 21:11:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-06 21:11:12,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-06 21:11:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-06 21:11:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-06 21:11:12,508 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-06 21:11:13,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-06 21:11:13,222 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-10-06 21:11:13,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 09:11:13 BoogieIcfgContainer [2021-10-06 21:11:13,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-06 21:11:13,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-06 21:11:13,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-06 21:11:13,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-06 21:11:13,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 09:11:11" (1/3) ... [2021-10-06 21:11:13,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43502f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 09:11:13, skipping insertion in model container [2021-10-06 21:11:13,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:11:12" (2/3) ... [2021-10-06 21:11:13,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43502f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 09:11:13, skipping insertion in model container [2021-10-06 21:11:13,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 09:11:13" (3/3) ... [2021-10-06 21:11:13,250 INFO L111 eAbstractionObserver]: Analyzing ICFG time-trans.wvr.c [2021-10-06 21:11:13,261 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-06 21:11:13,261 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-10-06 21:11:13,261 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-06 21:11:13,295 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,296 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,296 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,297 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,297 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,297 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,301 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,301 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,302 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,304 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,304 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,305 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,307 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,307 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,307 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:11:13,315 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-06 21:11:13,376 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-06 21:11:13,384 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=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-10-06 21:11:13,384 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-10-06 21:11:13,402 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-06 21:11:13,416 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 105 transitions, 234 flow [2021-10-06 21:11:13,420 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 105 transitions, 234 flow [2021-10-06 21:11:13,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 105 transitions, 234 flow [2021-10-06 21:11:13,476 INFO L129 PetriNetUnfolder]: 1/102 cut-off events. [2021-10-06 21:11:13,476 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-06 21:11:13,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 1/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2021-10-06 21:11:13,482 INFO L116 LiptonReduction]: Number of co-enabled transitions 240 [2021-10-06 21:11:26,071 INFO L131 LiptonReduction]: Checked pairs total: 507 [2021-10-06 21:11:26,072 INFO L133 LiptonReduction]: Total number of compositions: 102 [2021-10-06 21:11:26,082 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 33 transitions, 90 flow [2021-10-06 21:11:26,099 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 87 states, 73 states have (on average 2.287671232876712) internal successors, (167), 86 states have internal predecessors, (167), 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-10-06 21:11:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 2.287671232876712) internal successors, (167), 86 states have internal predecessors, (167), 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-10-06 21:11:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-06 21:11:26,108 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:26,109 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-06 21:11:26,109 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash 402, now seen corresponding path program 1 times [2021-10-06 21:11:26,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:26,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026307921] [2021-10-06 21:11:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:26,130 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:26,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:26,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:26,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-06 21:11:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:11:26,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-06 21:11:26,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:11:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:26,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:11:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:26,230 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:11:26,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026307921] [2021-10-06 21:11:26,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026307921] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:11:26,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:11:26,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0, 0] imperfect sequences [] total 0 [2021-10-06 21:11:26,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155975327] [2021-10-06 21:11:26,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-06 21:11:26,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:11:26,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-06 21:11:26,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-06 21:11:26,275 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 2.287671232876712) internal successors, (167), 86 states have internal predecessors, (167), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-10-06 21:11:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:11:26,303 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2021-10-06 21:11:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-06 21:11:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2021-10-06 21:11:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:11:26,324 INFO L225 Difference]: With dead ends: 84 [2021-10-06 21:11:26,324 INFO L226 Difference]: Without dead ends: 84 [2021-10-06 21:11:26,326 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-06 21:11:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-10-06 21:11:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-10-06 21:11:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 2.2465753424657535) internal successors, (164), 83 states have internal predecessors, (164), 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-10-06 21:11:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 164 transitions. [2021-10-06 21:11:26,373 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 164 transitions. Word has length 1 [2021-10-06 21:11:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:11:26,374 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 164 transitions. [2021-10-06 21:11:26,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-10-06 21:11:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 164 transitions. [2021-10-06 21:11:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 21:11:26,375 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:26,375 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 21:11:26,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-10-06 21:11:26,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:26,589 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash 395851, now seen corresponding path program 1 times [2021-10-06 21:11:26,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:26,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303469137] [2021-10-06 21:11:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:26,593 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:26,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:26,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:26,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-06 21:11:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:11:26,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-06 21:11:26,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:11:26,875 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-10-06 21:11:26,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2021-10-06 21:11:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:27,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:11:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:27,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:11:27,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303469137] [2021-10-06 21:11:27,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303469137] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:11:27,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:11:27,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-06 21:11:27,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664450751] [2021-10-06 21:11:27,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 21:11:27,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:11:27,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 21:11:27,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:27,097 INFO L87 Difference]: Start difference. First operand 84 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-06 21:11:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:11:27,156 INFO L93 Difference]: Finished difference Result 78 states and 153 transitions. [2021-10-06 21:11:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:11:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 3 [2021-10-06 21:11:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:11:27,159 INFO L225 Difference]: With dead ends: 78 [2021-10-06 21:11:27,159 INFO L226 Difference]: Without dead ends: 78 [2021-10-06 21:11:27,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-10-06 21:11:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-10-06 21:11:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 2.217391304347826) internal successors, (153), 77 states have internal predecessors, (153), 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-10-06 21:11:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 153 transitions. [2021-10-06 21:11:27,171 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 153 transitions. Word has length 3 [2021-10-06 21:11:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:11:27,171 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 153 transitions. [2021-10-06 21:11:27,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-06 21:11:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 153 transitions. [2021-10-06 21:11:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 21:11:27,172 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:27,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 21:11:27,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-06 21:11:27,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:27,387 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash 395852, now seen corresponding path program 1 times [2021-10-06 21:11:27,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:27,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490575703] [2021-10-06 21:11:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:27,391 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:27,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:27,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:27,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-06 21:11:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:11:27,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 21:11:27,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:11:27,631 INFO L354 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2021-10-06 21:11:27,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 64 [2021-10-06 21:11:27,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2021-10-06 21:11:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:27,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:11:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:27,924 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:11:27,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490575703] [2021-10-06 21:11:27,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490575703] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:11:27,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:11:27,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-06 21:11:27,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027847277] [2021-10-06 21:11:27,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 21:11:27,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:11:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 21:11:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:27,928 INFO L87 Difference]: Start difference. First operand 78 states and 153 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-06 21:11:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:11:27,980 INFO L93 Difference]: Finished difference Result 72 states and 142 transitions. [2021-10-06 21:11:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:11:27,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 3 [2021-10-06 21:11:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:11:27,983 INFO L225 Difference]: With dead ends: 72 [2021-10-06 21:11:27,983 INFO L226 Difference]: Without dead ends: 72 [2021-10-06 21:11:27,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-06 21:11:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-10-06 21:11:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 2.1846153846153844) internal successors, (142), 71 states have internal predecessors, (142), 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-10-06 21:11:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 142 transitions. [2021-10-06 21:11:27,992 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 142 transitions. Word has length 3 [2021-10-06 21:11:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:11:27,993 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 142 transitions. [2021-10-06 21:11:27,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-06 21:11:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 142 transitions. [2021-10-06 21:11:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-06 21:11:27,994 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:27,994 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-06 21:11:28,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-06 21:11:28,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:28,208 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash 380423428, now seen corresponding path program 1 times [2021-10-06 21:11:28,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:28,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125046307] [2021-10-06 21:11:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:28,212 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:28,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:28,214 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:28,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-06 21:11:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:11:28,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-06 21:11:28,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:11:28,313 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-10-06 21:11:28,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 22 [2021-10-06 21:11:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:28,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:11:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:28,388 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:11:28,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125046307] [2021-10-06 21:11:28,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125046307] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:11:28,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:11:28,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-06 21:11:28,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728223987] [2021-10-06 21:11:28,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 21:11:28,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:11:28,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 21:11:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 21:11:28,393 INFO L87 Difference]: Start difference. First operand 72 states and 142 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-10-06 21:11:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:11:28,438 INFO L93 Difference]: Finished difference Result 66 states and 131 transitions. [2021-10-06 21:11:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:11:28,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-10-06 21:11:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:11:28,441 INFO L225 Difference]: With dead ends: 66 [2021-10-06 21:11:28,441 INFO L226 Difference]: Without dead ends: 66 [2021-10-06 21:11:28,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 21:11:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-06 21:11:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-10-06 21:11:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 2.1475409836065573) internal successors, (131), 65 states have internal predecessors, (131), 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-10-06 21:11:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 131 transitions. [2021-10-06 21:11:28,449 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 131 transitions. Word has length 5 [2021-10-06 21:11:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:11:28,450 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 131 transitions. [2021-10-06 21:11:28,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-10-06 21:11:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 131 transitions. [2021-10-06 21:11:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-06 21:11:28,451 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:28,451 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-06 21:11:28,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-06 21:11:28,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:28,652 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:28,653 INFO L82 PathProgramCache]: Analyzing trace with hash 380423430, now seen corresponding path program 1 times [2021-10-06 21:11:28,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:28,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952368970] [2021-10-06 21:11:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:28,655 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:28,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:28,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-06 21:11:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:11:28,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-06 21:11:28,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:11:28,897 INFO L354 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2021-10-06 21:11:28,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2021-10-06 21:11:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:29,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:11:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:29,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:11:29,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952368970] [2021-10-06 21:11:29,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952368970] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:11:29,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:11:29,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-06 21:11:29,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665443005] [2021-10-06 21:11:29,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 21:11:29,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:11:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 21:11:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:29,089 INFO L87 Difference]: Start difference. First operand 66 states and 131 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10-06 21:11:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:11:29,116 INFO L93 Difference]: Finished difference Result 60 states and 120 transitions. [2021-10-06 21:11:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:11:29,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 5 [2021-10-06 21:11:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:11:29,118 INFO L225 Difference]: With dead ends: 60 [2021-10-06 21:11:29,118 INFO L226 Difference]: Without dead ends: 60 [2021-10-06 21:11:29,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-10-06 21:11:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-10-06 21:11:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 59 states have internal predecessors, (120), 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-10-06 21:11:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 120 transitions. [2021-10-06 21:11:29,125 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 120 transitions. Word has length 5 [2021-10-06 21:11:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:11:29,125 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 120 transitions. [2021-10-06 21:11:29,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10-06 21:11:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 120 transitions. [2021-10-06 21:11:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 21:11:29,126 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:29,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-06 21:11:29,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-06 21:11:29,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:29,339 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 514703716, now seen corresponding path program 1 times [2021-10-06 21:11:29,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:29,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545731633] [2021-10-06 21:11:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:29,342 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:29,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:29,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:29,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-06 21:11:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:11:29,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 21:11:29,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:11:29,594 INFO L354 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2021-10-06 21:11:29,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 59 [2021-10-06 21:11:29,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2021-10-06 21:11:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:29,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:11:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:29,929 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:11:29,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545731633] [2021-10-06 21:11:29,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545731633] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:11:29,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:11:29,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-06 21:11:29,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660141836] [2021-10-06 21:11:29,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 21:11:29,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:11:29,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 21:11:29,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:29,932 INFO L87 Difference]: Start difference. First operand 60 states and 120 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-06 21:11:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:11:29,962 INFO L93 Difference]: Finished difference Result 52 states and 100 transitions. [2021-10-06 21:11:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:11:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 7 [2021-10-06 21:11:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:11:29,965 INFO L225 Difference]: With dead ends: 52 [2021-10-06 21:11:29,965 INFO L226 Difference]: Without dead ends: 52 [2021-10-06 21:11:29,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:11:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-10-06 21:11:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-10-06 21:11:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 2.0) internal successors, (100), 51 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-10-06 21:11:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2021-10-06 21:11:29,970 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 100 transitions. Word has length 7 [2021-10-06 21:11:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:11:29,971 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 100 transitions. [2021-10-06 21:11:29,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-06 21:11:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 100 transitions. [2021-10-06 21:11:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 21:11:29,972 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:29,972 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-06 21:11:29,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-06 21:11:30,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:30,183 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash 514703717, now seen corresponding path program 1 times [2021-10-06 21:11:30,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:30,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229296161] [2021-10-06 21:11:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:30,186 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:30,187 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:30,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-06 21:11:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:11:30,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-06 21:11:30,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:11:30,307 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-10-06 21:11:30,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 22 [2021-10-06 21:11:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:30,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:11:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-06 21:11:30,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:11:30,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229296161] [2021-10-06 21:11:30,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229296161] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:11:30,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:11:30,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-06 21:11:30,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091601445] [2021-10-06 21:11:30,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 21:11:30,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:11:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 21:11:30,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 21:11:30,436 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-06 21:11:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:11:30,465 INFO L93 Difference]: Finished difference Result 44 states and 80 transitions. [2021-10-06 21:11:30,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:11:30,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 7 [2021-10-06 21:11:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:11:30,466 INFO L225 Difference]: With dead ends: 44 [2021-10-06 21:11:30,467 INFO L226 Difference]: Without dead ends: 44 [2021-10-06 21:11:30,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 21:11:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-06 21:11:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-10-06 21:11:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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-10-06 21:11:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 80 transitions. [2021-10-06 21:11:30,471 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 80 transitions. Word has length 7 [2021-10-06 21:11:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:11:30,472 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 80 transitions. [2021-10-06 21:11:30,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-06 21:11:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 80 transitions. [2021-10-06 21:11:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-06 21:11:30,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:11:30,473 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 21:11:30,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-10-06 21:11:30,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:30,674 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:11:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:11:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 86796128, now seen corresponding path program 1 times [2021-10-06 21:11:30,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:11:30,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741895515] [2021-10-06 21:11:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:11:30,676 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:11:30,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:11:30,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:11:30,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-06 21:11:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 21:11:30,787 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-06 21:11:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 21:11:30,957 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-10-06 21:11:30,957 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-06 21:11:30,961 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK [2021-10-06 21:11:30,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-06 21:11:30,966 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-06 21:11:30,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-06 21:11:30,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-06 21:11:30,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-06 21:11:30,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-06 21:11:30,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-06 21:11:30,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-06 21:11:30,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-06 21:11:30,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-06 21:11:30,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-06 21:11:30,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-06 21:11:30,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK [2021-10-06 21:11:30,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-06 21:11:30,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-06 21:11:30,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-06 21:11:30,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-06 21:11:31,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:31,199 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-06 21:11:31,199 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-06 21:11:31,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 09:11:31 BasicIcfg [2021-10-06 21:11:31,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-06 21:11:31,247 INFO L168 Benchmark]: Toolchain (without parser) took 19255.12 ms. Allocated memory was 161.5 MB in the beginning and 201.3 MB in the end (delta: 39.8 MB). Free memory was 136.1 MB in the beginning and 72.5 MB in the end (delta: 63.5 MB). Peak memory consumption was 104.3 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:31,247 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 161.5 MB. Free memory is still 133.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-06 21:11:31,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.63 ms. Allocated memory is still 161.5 MB. Free memory was 135.7 MB in the beginning and 125.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:31,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 161.5 MB. Free memory was 124.8 MB in the beginning and 123.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:31,249 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 161.5 MB. Free memory was 123.2 MB in the beginning and 121.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:31,249 INFO L168 Benchmark]: RCFGBuilder took 849.58 ms. Allocated memory is still 161.5 MB. Free memory was 121.9 MB in the beginning and 104.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:31,250 INFO L168 Benchmark]: TraceAbstraction took 18014.97 ms. Allocated memory was 161.5 MB in the beginning and 201.3 MB in the end (delta: 39.8 MB). Free memory was 103.6 MB in the beginning and 72.5 MB in the end (delta: 31.0 MB). Peak memory consumption was 71.8 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:31,253 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.26 ms. Allocated memory is still 161.5 MB. Free memory is still 133.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 290.63 ms. Allocated memory is still 161.5 MB. Free memory was 135.7 MB in the beginning and 125.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 161.5 MB. Free memory was 124.8 MB in the beginning and 123.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 161.5 MB. Free memory was 123.2 MB in the beginning and 121.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 849.58 ms. Allocated memory is still 161.5 MB. Free memory was 121.9 MB in the beginning and 104.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18014.97 ms. Allocated memory was 161.5 MB in the beginning and 201.3 MB in the end (delta: 39.8 MB). Free memory was 103.6 MB in the beginning and 72.5 MB in the end (delta: 31.0 MB). Peak memory consumption was 71.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12651.7ms, 114 PlacesBefore, 43 PlacesAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 6 FixpointIterations, 70 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, 507 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 507, positive: 507, positive conditional: 0, positive unconditional: 507, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 172, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 172, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 507, positive: 335, positive conditional: 0, positive unconditional: 335, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 172, unknown conditional: 0, unknown unconditional: 172] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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 - UnprovableResult [Line: 86]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 86. Possible FailurePath: [L38] 0 int ora_0, ora_2, ora_4; [L39] 0 int volume_totale_1, volume_totale_3, volume_totale_5; [L40] 0 int cmp_6, cmp_7, cmp_8; [L64] 0 pthread_t t1, t2, t3; [L67] 0 ora_0 = __VERIFIER_nondet_int() [L68] 0 ora_2 = __VERIFIER_nondet_int() [L69] 0 ora_4 = __VERIFIER_nondet_int() [L70] 0 volume_totale_1 = __VERIFIER_nondet_int() [L71] 0 volume_totale_3 = __VERIFIER_nondet_int() [L72] 0 volume_totale_5 = __VERIFIER_nondet_int() [L73] 0 cmp_6 = __VERIFIER_nondet_int() [L74] 0 cmp_7 = __VERIFIER_nondet_int() [L75] 0 cmp_8 = __VERIFIER_nondet_int() [L78] FCALL, FORK 0 pthread_create(&t1, NULL, thread1, NULL) [L44] 1 cmp_6 = ( ora_0 - ora_2 ) [L45] EXPR 1 ( cmp_6 == 0 ) ? ( volume_totale_1 - volume_totale_3 ) : cmp_6 [L45] 1 cmp_6 = ( ( cmp_6 == 0 ) ? ( volume_totale_1 - volume_totale_3 ) : cmp_6 ) [L79] FCALL, FORK 0 pthread_create(&t2, NULL, thread2, NULL) VAL [cmp_6=2122317824, ora_0=33554432, ora_2=-2088763392, volume_totale_1=239140864, volume_totale_3=272695296] [L51] 2 cmp_7 = ( ora_2 - ora_4 ) [L52] EXPR 2 ( cmp_7 == 0 ) ? ( volume_totale_3 - volume_totale_5 ) : cmp_7 [L52] 2 cmp_7 = ( ( cmp_7 == 0 ) ? ( volume_totale_3 - volume_totale_5 ) : cmp_7 ) [L80] FCALL, FORK 0 pthread_create(&t3, NULL, thread3, NULL) VAL [cmp_6=2122317824, cmp_7=1879048193, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] [L58] 3 cmp_8 = ( ora_0 - ora_4 ) [L59] EXPR 3 ( cmp_8 == 0 ) ? ( volume_totale_1 - volume_totale_5 ) : cmp_8 [L59] 3 cmp_8 = ( ( cmp_8 == 0 ) ? ( volume_totale_1 - volume_totale_5 ) : cmp_8 ) [L81] 0 \read(t1) VAL [cmp_6=2122317824, cmp_7=1879048193, cmp_8=-293601279, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] [L81] FCALL, JOIN 1 pthread_join(t1, 0) VAL [cmp_6=2122317824, cmp_7=1879048193, cmp_8=-293601279, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] [L82] 0 \read(t2) VAL [cmp_6=2122317824, cmp_7=1879048193, cmp_8=-293601279, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] [L82] FCALL, JOIN 2 pthread_join(t2, 0) VAL [cmp_6=2122317824, cmp_7=1879048193, cmp_8=-293601279, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] [L83] 0 \read(t3) VAL [cmp_6=2122317824, cmp_7=1879048193, cmp_8=-293601279, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] [L83] FCALL, JOIN 3 pthread_join(t3, 0) VAL [cmp_6=2122317824, cmp_7=1879048193, cmp_8=-293601279, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] [L35] COND FALSE 0 !(!cond) [L86] 0 reach_error() VAL [cmp_6=2122317824, cmp_7=1879048193, cmp_8=-293601279, ora_0=33554432, ora_2=-2088763392, ora_4=327155711, volume_totale_1=239140864, volume_totale_3=272695296, volume_totale_5=1312817152] - UnprovableResult [Line: 78]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 80]: 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: 79]: 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: 78]: 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 7 procedures, 117 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 17823.5ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 12.5ms, AutomataDifference: 348.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12714.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 100 SDtfs, 154 SDslu, 0 SDs, 0 SdLazy, 43 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 175.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 208.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 71.1ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 87.2ms SsaConstructionTime, 255.5ms SatisfiabilityAnalysisTime, 2066.7ms InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 48 ConstructedInterpolants, 10 QuantifiedInterpolants, 664 SizeOfPredicates, 23 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 could not prove your program: unable to determine feasibility of some traces [2021-10-06 21:11:31,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...