./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:59:51,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:59:51,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:59:51,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:59:51,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:59:51,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:59:51,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:59:51,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:59:51,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:59:51,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:59:51,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:59:51,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:59:51,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:59:51,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:59:51,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:59:51,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:59:51,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:59:51,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:59:51,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:59:51,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:59:51,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:59:51,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:59:51,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:59:51,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:59:51,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:59:51,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:59:51,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:59:51,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:59:51,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:59:51,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:59:51,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:59:51,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:59:51,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:59:51,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:59:51,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:59:51,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:59:51,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:59:51,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:59:51,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:59:51,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:59:51,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:59:51,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:59:51,356 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:59:51,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:59:51,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:59:51,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:59:51,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:59:51,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:59:51,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:59:51,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:59:51,359 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:59:51,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:59:51,360 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:59:51,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:59:51,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:59:51,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:59:51,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:59:51,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:59:51,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:59:51,361 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:59:51,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:59:51,361 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:59:51,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:59:51,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:59:51,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:59:51,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:59:51,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:59:51,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:59:51,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:59:51,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:59:51,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:59:51,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:59:51,364 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:59:51,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:59:51,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:59:51,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:59:51,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2021-12-15 23:59:51,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:59:51,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:59:51,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:59:51,569 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:59:51,570 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:59:51,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-12-15 23:59:51,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5797a39e2/cd1cf3aa5a644ef1811388b08608d083/FLAG285391ea5 [2021-12-15 23:59:52,082 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:59:52,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-12-15 23:59:52,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5797a39e2/cd1cf3aa5a644ef1811388b08608d083/FLAG285391ea5 [2021-12-15 23:59:52,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5797a39e2/cd1cf3aa5a644ef1811388b08608d083 [2021-12-15 23:59:52,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:59:52,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:59:52,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:59:52,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:59:52,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:59:52,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f21906b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52, skipping insertion in model container [2021-12-15 23:59:52,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:59:52,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:59:52,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-12-15 23:59:52,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:59:52,372 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:59:52,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-12-15 23:59:52,418 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:59:52,435 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:59:52,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52 WrapperNode [2021-12-15 23:59:52,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:59:52,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:59:52,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:59:52,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:59:52,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,481 INFO L137 Inliner]: procedures = 123, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2021-12-15 23:59:52,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:59:52,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:59:52,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:59:52,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:59:52,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:59:52,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:59:52,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:59:52,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:59:52,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (1/1) ... [2021-12-15 23:59:52,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:59:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:52,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 23:59:52,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 23:59:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:59:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:59:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:59:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:59:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:59:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:59:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:59:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:59:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:59:52,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:59:52,622 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:59:52,623 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:59:52,746 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:59:52,750 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:59:52,750 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 23:59:52,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:59:52 BoogieIcfgContainer [2021-12-15 23:59:52,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:59:52,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:59:52,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:59:52,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:59:52,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:59:52" (1/3) ... [2021-12-15 23:59:52,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd671ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:59:52, skipping insertion in model container [2021-12-15 23:59:52,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:59:52" (2/3) ... [2021-12-15 23:59:52,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd671ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:59:52, skipping insertion in model container [2021-12-15 23:59:52,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:59:52" (3/3) ... [2021-12-15 23:59:52,758 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2021-12-15 23:59:52,761 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:59:52,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:59:52,806 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:59:52,811 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 23:59:52,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:59:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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-12-15 23:59:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 23:59:52,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:52,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:52,842 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2021-12-15 23:59:52,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:52,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088677181] [2021-12-15 23:59:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:52,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:52,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:52,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088677181] [2021-12-15 23:59:52,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088677181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:52,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:52,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:59:52,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681406048] [2021-12-15 23:59:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:52,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:59:52,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:59:53,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:59:53,011 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-15 23:59:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:53,023 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2021-12-15 23:59:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:59:53,025 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-12-15 23:59:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:53,029 INFO L225 Difference]: With dead ends: 48 [2021-12-15 23:59:53,030 INFO L226 Difference]: Without dead ends: 24 [2021-12-15 23:59:53,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:59:53,034 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:53,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-15 23:59:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-15 23:59:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-12-15 23:59:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-12-15 23:59:53,060 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2021-12-15 23:59:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:53,060 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-12-15 23:59:53,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-15 23:59:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-12-15 23:59:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 23:59:53,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:53,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:53,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:59:53,062 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2021-12-15 23:59:53,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:53,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084706147] [2021-12-15 23:59:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:53,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:53,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:53,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084706147] [2021-12-15 23:59:53,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084706147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:53,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:53,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:59:53,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107149981] [2021-12-15 23:59:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:53,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:59:53,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:59:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:59:53,130 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-15 23:59:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:53,150 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2021-12-15 23:59:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:59:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-12-15 23:59:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:53,151 INFO L225 Difference]: With dead ends: 46 [2021-12-15 23:59:53,151 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:59:53,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:59:53,153 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:53,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:59:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2021-12-15 23:59:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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-12-15 23:59:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2021-12-15 23:59:53,160 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2021-12-15 23:59:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:53,160 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-12-15 23:59:53,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-15 23:59:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2021-12-15 23:59:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:59:53,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:53,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:53,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:59:53,162 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2031015874, now seen corresponding path program 1 times [2021-12-15 23:59:53,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:53,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114145112] [2021-12-15 23:59:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:53,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:53,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:53,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114145112] [2021-12-15 23:59:53,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114145112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:53,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:53,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:59:53,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525682907] [2021-12-15 23:59:53,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:53,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:59:53,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:59:53,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:59:53,248 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-15 23:59:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:53,270 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2021-12-15 23:59:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:59:53,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-12-15 23:59:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:53,272 INFO L225 Difference]: With dead ends: 53 [2021-12-15 23:59:53,272 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:59:53,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:59:53,275 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:53,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:59:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-12-15 23:59:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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-12-15 23:59:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2021-12-15 23:59:53,280 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 19 [2021-12-15 23:59:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:53,281 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2021-12-15 23:59:53,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-15 23:59:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2021-12-15 23:59:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:59:53,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:53,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:53,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 23:59:53,282 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1772850436, now seen corresponding path program 1 times [2021-12-15 23:59:53,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:53,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061260035] [2021-12-15 23:59:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:53,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:53,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061260035] [2021-12-15 23:59:53,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061260035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:53,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:53,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 23:59:53,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510929058] [2021-12-15 23:59:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:53,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:59:53,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:59:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:59:53,387 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12-15 23:59:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:53,535 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2021-12-15 23:59:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 23:59:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2021-12-15 23:59:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:53,536 INFO L225 Difference]: With dead ends: 77 [2021-12-15 23:59:53,536 INFO L226 Difference]: Without dead ends: 64 [2021-12-15 23:59:53,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:59:53,537 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 128 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:53,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 120 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:59:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-15 23:59:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2021-12-15 23:59:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 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-12-15 23:59:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2021-12-15 23:59:53,542 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 19 [2021-12-15 23:59:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:53,542 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2021-12-15 23:59:53,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12-15 23:59:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2021-12-15 23:59:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:59:53,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:53,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:53,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 23:59:53,543 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1771003394, now seen corresponding path program 1 times [2021-12-15 23:59:53,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114064443] [2021-12-15 23:59:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:53,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:53,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:53,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114064443] [2021-12-15 23:59:53,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114064443] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:53,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224807989] [2021-12-15 23:59:53,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:53,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:53,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:53,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:59:53,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 23:59:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:53,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:59:53,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:53,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:53,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224807989] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:53,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:53,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-15 23:59:53,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485256988] [2021-12-15 23:59:53,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:53,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:59:53,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:59:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:53,766 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-12-15 23:59:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:53,784 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2021-12-15 23:59:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:59:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 19 [2021-12-15 23:59:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:53,786 INFO L225 Difference]: With dead ends: 77 [2021-12-15 23:59:53,786 INFO L226 Difference]: Without dead ends: 57 [2021-12-15 23:59:53,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:53,787 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:53,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-15 23:59:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2021-12-15 23:59:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 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-12-15 23:59:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2021-12-15 23:59:53,792 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 19 [2021-12-15 23:59:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:53,792 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2021-12-15 23:59:53,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-12-15 23:59:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2021-12-15 23:59:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:59:53,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:53,793 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:53,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 23:59:54,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:54,024 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash -338892847, now seen corresponding path program 1 times [2021-12-15 23:59:54,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:54,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580928881] [2021-12-15 23:59:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:54,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:54,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:54,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580928881] [2021-12-15 23:59:54,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580928881] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:54,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733735663] [2021-12-15 23:59:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:54,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:54,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:54,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:59:54,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 23:59:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:54,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 23:59:54,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:54,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:54,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733735663] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:54,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:54,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2021-12-15 23:59:54,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590019560] [2021-12-15 23:59:54,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:54,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:59:54,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:54,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:59:54,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:59:54,422 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-12-15 23:59:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:54,442 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2021-12-15 23:59:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 23:59:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 40 [2021-12-15 23:59:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:54,442 INFO L225 Difference]: With dead ends: 82 [2021-12-15 23:59:54,443 INFO L226 Difference]: Without dead ends: 62 [2021-12-15 23:59:54,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:59:54,443 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:54,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-15 23:59:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2021-12-15 23:59:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 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-12-15 23:59:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2021-12-15 23:59:54,447 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 40 [2021-12-15 23:59:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:54,448 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2021-12-15 23:59:54,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-12-15 23:59:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2021-12-15 23:59:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 23:59:54,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:54,449 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:54,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 23:59:54,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-15 23:59:54,665 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2036506556, now seen corresponding path program 2 times [2021-12-15 23:59:54,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:54,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745995818] [2021-12-15 23:59:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:54,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-15 23:59:54,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:54,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745995818] [2021-12-15 23:59:54,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745995818] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:54,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348026827] [2021-12-15 23:59:54,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 23:59:54,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:54,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:59:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 23:59:54,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 23:59:54,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:59:54,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 23:59:54,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:55,028 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:59:55,051 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 23:59:55,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 23:59:55,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:55,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-15 23:59:55,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:55,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:55,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:55,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:55,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:55,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:55,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2021-12-15 23:59:55,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:59:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-15 23:59:55,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:55,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_717) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-15 23:59:55,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_713 Int) (v_ArrVal_712 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 16) v_ArrVal_714) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_713) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) v_ArrVal_712)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_717) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-15 23:59:55,294 INFO L354 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2021-12-15 23:59:55,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2021-12-15 23:59:55,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 22 [2021-12-15 23:59:55,300 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 5 treesize of output 3 [2021-12-15 23:59:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2021-12-15 23:59:55,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348026827] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:55,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:55,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 21 [2021-12-15 23:59:55,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258354981] [2021-12-15 23:59:55,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:55,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 23:59:55,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 23:59:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=295, Unknown=2, NotChecked=70, Total=420 [2021-12-15 23:59:55,378 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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-12-15 23:59:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:55,780 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2021-12-15 23:59:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 23:59:55,781 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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 47 [2021-12-15 23:59:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:55,781 INFO L225 Difference]: With dead ends: 97 [2021-12-15 23:59:55,781 INFO L226 Difference]: Without dead ends: 84 [2021-12-15 23:59:55,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=806, Unknown=2, NotChecked=126, Total=1190 [2021-12-15 23:59:55,782 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 298 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:55,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 155 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 227 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2021-12-15 23:59:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-15 23:59:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2021-12-15 23:59:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 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-12-15 23:59:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2021-12-15 23:59:55,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 47 [2021-12-15 23:59:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:55,786 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-15 23:59:55,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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-12-15 23:59:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2021-12-15 23:59:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 23:59:55,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:55,787 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:55,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 23:59:55,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:55,988 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:55,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2038353598, now seen corresponding path program 1 times [2021-12-15 23:59:55,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:55,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201430117] [2021-12-15 23:59:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:55,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 23:59:56,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:56,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201430117] [2021-12-15 23:59:56,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201430117] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:56,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083573094] [2021-12-15 23:59:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:56,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:56,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:59:56,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 23:59:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:56,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-15 23:59:56,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:56,391 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:59:56,413 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 23:59:56,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 23:59:56,440 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-15 23:59:56,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2021-12-15 23:59:56,489 INFO L354 Elim1Store]: treesize reduction 181, result has 13.4 percent of original size [2021-12-15 23:59:56,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 40 [2021-12-15 23:59:56,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 23:59:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-15 23:59:56,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:56,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1058 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1058) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0)) is different from false [2021-12-15 23:59:56,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (v_ArrVal_1052 Int) (v_ArrVal_1056 Int) (v_ArrVal_1058 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 16) v_ArrVal_1056) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1052) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) v_ArrVal_1053)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1058) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0)) is different from false [2021-12-15 23:59:56,673 INFO L354 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2021-12-15 23:59:56,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2021-12-15 23:59:56,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 24 [2021-12-15 23:59:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2021-12-15 23:59:56,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083573094] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:56,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:56,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 23 [2021-12-15 23:59:56,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554703608] [2021-12-15 23:59:56,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:56,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 23:59:56,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:56,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 23:59:56,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=366, Unknown=2, NotChecked=78, Total=506 [2021-12-15 23:59:56,735 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:57,023 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2021-12-15 23:59:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 23:59:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-15 23:59:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:57,024 INFO L225 Difference]: With dead ends: 90 [2021-12-15 23:59:57,024 INFO L226 Difference]: Without dead ends: 77 [2021-12-15 23:59:57,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=817, Unknown=2, NotChecked=126, Total=1190 [2021-12-15 23:59:57,025 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 321 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:57,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 144 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 224 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2021-12-15 23:59:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-15 23:59:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2021-12-15 23:59:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-12-15 23:59:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2021-12-15 23:59:57,029 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 47 [2021-12-15 23:59:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:57,030 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2021-12-15 23:59:57,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2021-12-15 23:59:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 23:59:57,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:57,030 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:57,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 23:59:57,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:57,231 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2038355520, now seen corresponding path program 1 times [2021-12-15 23:59:57,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:57,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500461907] [2021-12-15 23:59:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:57,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 23:59:57,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 23:59:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 23:59:57,341 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 23:59:57,342 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 23:59:57,342 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 23:59:57,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 23:59:57,345 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:57,347 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 23:59:57,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:59:57 BoogieIcfgContainer [2021-12-15 23:59:57,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 23:59:57,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 23:59:57,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 23:59:57,373 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 23:59:57,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:59:52" (3/4) ... [2021-12-15 23:59:57,375 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-15 23:59:57,409 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 23:59:57,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 23:59:57,410 INFO L158 Benchmark]: Toolchain (without parser) took 5303.27ms. Allocated memory was 109.1MB in the beginning and 190.8MB in the end (delta: 81.8MB). Free memory was 81.5MB in the beginning and 145.7MB in the end (delta: -64.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2021-12-15 23:59:57,410 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 68.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:59:57,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.05ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 23:59:57,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.40ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:59:57,411 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 75.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:59:57,411 INFO L158 Benchmark]: RCFGBuilder took 239.85ms. Allocated memory is still 109.1MB. Free memory was 75.4MB in the beginning and 62.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 23:59:57,411 INFO L158 Benchmark]: TraceAbstraction took 4619.94ms. Allocated memory was 109.1MB in the beginning and 190.8MB in the end (delta: 81.8MB). Free memory was 62.3MB in the beginning and 149.9MB in the end (delta: -87.6MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2021-12-15 23:59:57,411 INFO L158 Benchmark]: Witness Printer took 36.47ms. Allocated memory is still 190.8MB. Free memory was 149.9MB in the beginning and 145.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 23:59:57,412 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.20ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 68.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.05ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.40ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 75.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 239.85ms. Allocated memory is still 109.1MB. Free memory was 75.4MB in the beginning and 62.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4619.94ms. Allocated memory was 109.1MB in the beginning and 190.8MB in the end (delta: 81.8MB). Free memory was 62.3MB in the beginning and 149.9MB in the end (delta: -87.6MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * Witness Printer took 36.47ms. Allocated memory is still 190.8MB. Free memory was 149.9MB in the beginning and 145.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 616]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, new_head={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 836 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 753 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 219 IncrementalHoareTripleChecker+Unchecked, 534 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 608 IncrementalHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 219 mSDtfsCounter, 608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 298 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 87 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 505 ConstructedInterpolants, 6 QuantifiedInterpolants, 1705 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1547 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 392/593 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-15 23:59:57,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE