./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/forester-heap/dll-sorted-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 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:51:29,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:51:29,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:51:29,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:51:29,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:51:29,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:51:29,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:51:29,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:51:29,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:51:29,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:51:29,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:51:29,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:51:29,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:51:29,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:51:29,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:51:29,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:51:29,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:51:29,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:51:29,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:51:29,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:51:29,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:51:29,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:51:29,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:51:29,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:51:29,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:51:29,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:51:29,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:51:29,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:51:29,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:51:29,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:51:29,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:51:29,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:51:29,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:51:29,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:51:29,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:51:29,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:51:29,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:51:29,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:51:29,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:51:29,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:51:29,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:51:29,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:51:29,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:51:29,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:51:29,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:51:29,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:51:29,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:51:29,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:51:29,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:51:29,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:51:29,588 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:51:29,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:51:29,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:51:29,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:51:29,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:51:29,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:51:29,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:51:29,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:51:29,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:51:29,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:51:29,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:51:29,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:51:29,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:51:29,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:51:29,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:51:29,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:51:29,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:51:29,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:51:29,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:51:29,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:51:29,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:51:29,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:51:29,593 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:51:29,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:51:29,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:51:29,594 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 -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2022-02-20 16:51:29,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:51:29,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:51:29,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:51:29,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:51:29,810 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:51:29,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-02-20 16:51:29,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b51f25/a602637e924846fbafab6aca3cbca3db/FLAG392200b4a [2022-02-20 16:51:30,315 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:51:30,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-02-20 16:51:30,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b51f25/a602637e924846fbafab6aca3cbca3db/FLAG392200b4a [2022-02-20 16:51:30,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b51f25/a602637e924846fbafab6aca3cbca3db [2022-02-20 16:51:30,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:51:30,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:51:30,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:51:30,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:51:30,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:51:30,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21054757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30, skipping insertion in model container [2022-02-20 16:51:30,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:51:30,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:51:30,641 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/forester-heap/dll-sorted-1.i[22384,22397] [2022-02-20 16:51:30,645 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/forester-heap/dll-sorted-1.i[22614,22627] [2022-02-20 16:51:30,649 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/forester-heap/dll-sorted-1.i[22989,23002] [2022-02-20 16:51:30,649 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/forester-heap/dll-sorted-1.i[23053,23066] [2022-02-20 16:51:30,651 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/forester-heap/dll-sorted-1.i[23184,23197] [2022-02-20 16:51:30,651 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/forester-heap/dll-sorted-1.i[23248,23261] [2022-02-20 16:51:30,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:51:30,660 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:51:30,691 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/forester-heap/dll-sorted-1.i[22384,22397] [2022-02-20 16:51:30,693 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/forester-heap/dll-sorted-1.i[22614,22627] [2022-02-20 16:51:30,697 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/forester-heap/dll-sorted-1.i[22989,23002] [2022-02-20 16:51:30,697 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/forester-heap/dll-sorted-1.i[23053,23066] [2022-02-20 16:51:30,699 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/forester-heap/dll-sorted-1.i[23184,23197] [2022-02-20 16:51:30,700 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/forester-heap/dll-sorted-1.i[23248,23261] [2022-02-20 16:51:30,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:51:30,723 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:51:30,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30 WrapperNode [2022-02-20 16:51:30,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:51:30,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:51:30,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:51:30,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:51:30,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,793 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 194 [2022-02-20 16:51:30,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:51:30,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:51:30,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:51:30,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:51:30,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:51:30,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:51:30,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:51:30,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:51:30,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (1/1) ... [2022-02-20 16:51:30,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:51:30,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:51:30,870 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) [2022-02-20 16:51:30,881 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 [2022-02-20 16:51:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:51:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:51:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:51:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:51:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:51:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:51:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:51:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:51:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:51:30,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:51:31,016 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:51:31,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:51:31,387 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:51:31,393 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:51:31,394 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:51:31,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:31 BoogieIcfgContainer [2022-02-20 16:51:31,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:51:31,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:51:31,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:51:31,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:51:31,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:51:30" (1/3) ... [2022-02-20 16:51:31,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2dc145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:31, skipping insertion in model container [2022-02-20 16:51:31,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:30" (2/3) ... [2022-02-20 16:51:31,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2dc145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:31, skipping insertion in model container [2022-02-20 16:51:31,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:31" (3/3) ... [2022-02-20 16:51:31,402 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2022-02-20 16:51:31,413 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:51:31,414 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-20 16:51:31,455 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:51:31,460 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 [2022-02-20 16:51:31,460 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-20 16:51:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 55 states have internal predecessors, (91), 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) [2022-02-20 16:51:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:51:31,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:31,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:51:31,484 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash 890153286, now seen corresponding path program 1 times [2022-02-20 16:51:31,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:31,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853972712] [2022-02-20 16:51:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:31,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:31,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {59#true} is VALID [2022-02-20 16:51:31,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {59#true} is VALID [2022-02-20 16:51:31,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {59#true} assume !true; {60#false} is VALID [2022-02-20 16:51:31,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {60#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {60#false} is VALID [2022-02-20 16:51:31,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {60#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {60#false} is VALID [2022-02-20 16:51:31,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#false} assume !false; {60#false} is VALID [2022-02-20 16:51:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:31,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:31,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853972712] [2022-02-20 16:51:31,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853972712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:31,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:31,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:51:31,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378558739] [2022-02-20 16:51:31,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 16:51:31,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:31,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:31,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:51:31,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:31,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:51:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:51:31,770 INFO L87 Difference]: Start difference. First operand has 56 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 55 states have internal predecessors, (91), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:31,873 INFO L93 Difference]: Finished difference Result 106 states and 172 transitions. [2022-02-20 16:51:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:51:31,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 16:51:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2022-02-20 16:51:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2022-02-20 16:51:31,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 172 transitions. [2022-02-20 16:51:32,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:32,081 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:51:32,082 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 16:51:32,084 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 [2022-02-20 16:51:32,088 INFO L933 BasicCegarLoop]: 67 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, 67 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 [2022-02-20 16:51:32,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:51:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 16:51:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 16:51:32,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:32,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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) [2022-02-20 16:51:32,110 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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) [2022-02-20 16:51:32,111 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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) [2022-02-20 16:51:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,117 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-02-20 16:51:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 16:51:32,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:32,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:32,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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 50 states. [2022-02-20 16:51:32,122 INFO L87 Difference]: Start difference. First operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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 50 states. [2022-02-20 16:51:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,125 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-02-20 16:51:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 16:51:32,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:32,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:32,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:32,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:32,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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) [2022-02-20 16:51:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-02-20 16:51:32,132 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 6 [2022-02-20 16:51:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:32,133 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-02-20 16:51:32,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 16:51:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:51:32,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:32,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:32,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:51:32,134 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:32,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1806859191, now seen corresponding path program 1 times [2022-02-20 16:51:32,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:32,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118826216] [2022-02-20 16:51:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:32,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {343#true} is VALID [2022-02-20 16:51:32,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 16:51:32,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 16:51:32,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {344#false} is VALID [2022-02-20 16:51:32,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {344#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {344#false} is VALID [2022-02-20 16:51:32,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {344#false} is VALID [2022-02-20 16:51:32,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-02-20 16:51:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:32,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:32,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118826216] [2022-02-20 16:51:32,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118826216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:32,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:32,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:51:32,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646580600] [2022-02-20 16:51:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:51:32,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:32,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-02-20 16:51:32,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:32,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:51:32,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:51:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:51:32,219 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-02-20 16:51:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,324 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-02-20 16:51:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:51:32,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:51:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-02-20 16:51:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 16:51:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-02-20 16:51:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 16:51:32,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2022-02-20 16:51:32,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:32,457 INFO L225 Difference]: With dead ends: 103 [2022-02-20 16:51:32,457 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:51:32,458 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 [2022-02-20 16:51:32,460 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:32,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:51:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:51:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-02-20 16:51:32,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:32,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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) [2022-02-20 16:51:32,471 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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) [2022-02-20 16:51:32,471 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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) [2022-02-20 16:51:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,477 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-02-20 16:51:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-02-20 16:51:32,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:32,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:32,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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 55 states. [2022-02-20 16:51:32,479 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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 55 states. [2022-02-20 16:51:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,485 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-02-20 16:51:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-02-20 16:51:32,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:32,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:32,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:32,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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) [2022-02-20 16:51:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-02-20 16:51:32,492 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 7 [2022-02-20 16:51:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:32,492 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-20 16:51:32,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-02-20 16:51:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-20 16:51:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:51:32,494 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:32,495 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:32,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:51:32,495 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 443319948, now seen corresponding path program 1 times [2022-02-20 16:51:32,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:32,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113081167] [2022-02-20 16:51:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:32,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {638#true} is VALID [2022-02-20 16:51:32,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:32,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:32,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:32,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:32,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_~marked~0#1;call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:32,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:32,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:32,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {641#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 16:51:32,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {639#false} is VALID [2022-02-20 16:51:32,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {639#false} assume !false; {639#false} is VALID [2022-02-20 16:51:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:51:32,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:32,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113081167] [2022-02-20 16:51:32,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113081167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:32,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:32,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:51:32,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072911338] [2022-02-20 16:51:32,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:32,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:51:32,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:32,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:32,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:51:32,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:32,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:51:32,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:51:32,683 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,885 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2022-02-20 16:51:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:51:32,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:51:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-02-20 16:51:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-02-20 16:51:32,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-02-20 16:51:32,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:32,985 INFO L225 Difference]: With dead ends: 87 [2022-02-20 16:51:32,985 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 16:51:32,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:51:32,986 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 129 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:32,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:51:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 16:51:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2022-02-20 16:51:32,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:32,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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) [2022-02-20 16:51:32,993 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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) [2022-02-20 16:51:32,993 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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) [2022-02-20 16:51:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,996 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-02-20 16:51:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-02-20 16:51:33,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:33,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:33,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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 85 states. [2022-02-20 16:51:33,000 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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 85 states. [2022-02-20 16:51:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:33,003 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-02-20 16:51:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-02-20 16:51:33,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:33,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:33,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:33,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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) [2022-02-20 16:51:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-02-20 16:51:33,007 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 11 [2022-02-20 16:51:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:33,007 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-02-20 16:51:33,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-20 16:51:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:51:33,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:33,008 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:33,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:51:33,009 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:33,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1236050174, now seen corresponding path program 1 times [2022-02-20 16:51:33,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:33,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386459167] [2022-02-20 16:51:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:51:33,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:51:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:51:33,175 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:51:33,176 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:51:33,177 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-20 16:51:33,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-20 16:51:33,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-02-20 16:51:33,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-02-20 16:51:33,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-02-20 16:51:33,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-20 16:51:33,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:51:33,188 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:51:33,191 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:51:33,240 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:51:33,241 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:51:33,241 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2022-02-20 16:51:33,241 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2022-02-20 16:51:33,241 WARN L170 areAnnotationChecker]: L1006-3 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1006-1 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1006-1 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2022-02-20 16:51:33,242 WARN L170 areAnnotationChecker]: L1027-5 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1030-5 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1030-5 has no Hoare annotation [2022-02-20 16:51:33,243 WARN L170 areAnnotationChecker]: L1038-6 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1038-6 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1035-4 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2022-02-20 16:51:33,244 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1035-2 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1035-2 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1038-5 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1038-5 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1059-5 has no Hoare annotation [2022-02-20 16:51:33,245 WARN L170 areAnnotationChecker]: L1059-5 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1059-1 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1059-1 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2022-02-20 16:51:33,246 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1066-2 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1069-5 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1069-5 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1059-3 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1059-3 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1075-2 has no Hoare annotation [2022-02-20 16:51:33,247 WARN L170 areAnnotationChecker]: L1075-2 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1075-2 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1069-1 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1069-1 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1070-3 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1070-3 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1070-3 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1062-5 has no Hoare annotation [2022-02-20 16:51:33,248 WARN L170 areAnnotationChecker]: L1062-5 has no Hoare annotation [2022-02-20 16:51:33,249 WARN L170 areAnnotationChecker]: L1075-3 has no Hoare annotation [2022-02-20 16:51:33,249 WARN L170 areAnnotationChecker]: L1069-2 has no Hoare annotation [2022-02-20 16:51:33,250 WARN L170 areAnnotationChecker]: L1069-2 has no Hoare annotation [2022-02-20 16:51:33,250 WARN L170 areAnnotationChecker]: L1069-4 has no Hoare annotation [2022-02-20 16:51:33,250 WARN L170 areAnnotationChecker]: L1069-4 has no Hoare annotation [2022-02-20 16:51:33,251 WARN L170 areAnnotationChecker]: L1070-4 has no Hoare annotation [2022-02-20 16:51:33,251 WARN L170 areAnnotationChecker]: L1070 has no Hoare annotation [2022-02-20 16:51:33,251 WARN L170 areAnnotationChecker]: L1070 has no Hoare annotation [2022-02-20 16:51:33,252 WARN L170 areAnnotationChecker]: L1070-2 has no Hoare annotation [2022-02-20 16:51:33,252 WARN L170 areAnnotationChecker]: L1070-2 has no Hoare annotation [2022-02-20 16:51:33,252 WARN L170 areAnnotationChecker]: L1062-1 has no Hoare annotation [2022-02-20 16:51:33,257 WARN L170 areAnnotationChecker]: L1062-1 has no Hoare annotation [2022-02-20 16:51:33,257 WARN L170 areAnnotationChecker]: L1063-3 has no Hoare annotation [2022-02-20 16:51:33,257 WARN L170 areAnnotationChecker]: L1063-3 has no Hoare annotation [2022-02-20 16:51:33,257 WARN L170 areAnnotationChecker]: L1063-3 has no Hoare annotation [2022-02-20 16:51:33,257 WARN L170 areAnnotationChecker]: L1082 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1062-2 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1062-2 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1062-4 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1062-4 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1063-4 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1063-2 has no Hoare annotation [2022-02-20 16:51:33,258 WARN L170 areAnnotationChecker]: L1063-2 has no Hoare annotation [2022-02-20 16:51:33,259 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:51:33,259 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:51:33,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:51:33 BoogieIcfgContainer [2022-02-20 16:51:33,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:51:33,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:51:33,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:51:33,262 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:51:33,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:31" (3/4) ... [2022-02-20 16:51:33,264 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 16:51:33,312 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:51:33,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:51:33,313 INFO L158 Benchmark]: Toolchain (without parser) took 2962.09ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 68.2MB in the beginning and 62.4MB in the end (delta: 5.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-02-20 16:51:33,314 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 75.5MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:51:33,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.99ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 48.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:51:33,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.36ms. Allocated memory is still 92.3MB. Free memory was 48.2MB in the beginning and 45.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:33,314 INFO L158 Benchmark]: Boogie Preprocessor took 48.76ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:33,315 INFO L158 Benchmark]: RCFGBuilder took 549.50ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 50.1MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:51:33,315 INFO L158 Benchmark]: TraceAbstraction took 1864.14ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 49.8MB in the beginning and 65.5MB in the end (delta: -15.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 16:51:33,315 INFO L158 Benchmark]: Witness Printer took 50.71ms. Allocated memory is still 115.3MB. Free memory was 65.5MB in the beginning and 62.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:33,318 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 75.5MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.99ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 48.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.36ms. Allocated memory is still 92.3MB. Free memory was 48.2MB in the beginning and 45.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.76ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 549.50ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 50.1MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1864.14ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 49.8MB in the beginning and 65.5MB in the end (delta: -15.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 50.71ms. Allocated memory is still 115.3MB. Free memory was 65.5MB in the beginning and 62.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. 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: 1038]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] head->data = 0 [L1002] SLL* x = head; [L1003] int marked = 0; VAL [head={-1:0}, marked=0, x={-1:0}] [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1009] x->next = malloc(sizeof(SLL)) [L1010] EXPR x->next [L1010] x->next->prev = x [L1011] EXPR x->next [L1011] x = x->next [L1012] x->next = ((void*)0) [L1014] COND TRUE __VERIFIER_nondet_int() [L1016] marked = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1019] COND TRUE \read(marked) [L1020] x->data = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1025] x = head VAL [head={-1:0}, marked=1, x={-1:0}] [L1027] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, marked=1, x={-1:0}] [L1028] marked = 0 VAL [head={-1:0}, marked=0, x={-1:0}] [L1030] EXPR x->next [L1030] x->next != ((void*)0) && x->next->data == 0 [L1030] EXPR x->next [L1030] EXPR x->next->data [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1030] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1035] EXPR x->next [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=3, head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1035] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1037] EXPR x->next [L1037] x = x->next [L1038] EXPR x->data VAL [head={-1:0}, marked=0, x={-2:0}, x->data=1] [L1038] COND TRUE !(x->data != 1) [L1038] reach_error() VAL [head={-1:0}, marked=0, x={-2:0}] - UnprovableResult [Line: 1027]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1070]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 161 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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! [2022-02-20 16:51:33,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- 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