./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/AllInterval-005.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-005.c -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 a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 15:27:23,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 15:27:23,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 15:27:23,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 15:27:23,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 15:27:23,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 15:27:23,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 15:27:23,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 15:27:23,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 15:27:23,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 15:27:23,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 15:27:23,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 15:27:23,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 15:27:23,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 15:27:23,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 15:27:23,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 15:27:23,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 15:27:23,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 15:27:23,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 15:27:23,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 15:27:23,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 15:27:23,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 15:27:23,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 15:27:23,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 15:27:23,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 15:27:23,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 15:27:23,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 15:27:23,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 15:27:23,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 15:27:23,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 15:27:23,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 15:27:23,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 15:27:23,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 15:27:23,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 15:27:23,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 15:27:23,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 15:27:23,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 15:27:23,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 15:27:23,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 15:27:23,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 15:27:23,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 15:27:23,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 15:27:23,704 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 15:27:23,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 15:27:23,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 15:27:23,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 15:27:23,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 15:27:23,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 15:27:23,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 15:27:23,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 15:27:23,706 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 15:27:23,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 15:27:23,706 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 15:27:23,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 15:27:23,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 15:27:23,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 15:27:23,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 15:27:23,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 15:27:23,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 15:27:23,707 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 15:27:23,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 15:27:23,708 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 15:27:23,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 15:27:23,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 15:27:23,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 15:27:23,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 15:27:23,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:27:23,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 15:27:23,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 15:27:23,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 15:27:23,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 15:27:23,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 15:27:23,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 15:27:23,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 15:27:23,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 15:27:23,710 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 15:27:23,710 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 -> a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 [2021-12-14 15:27:23,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 15:27:23,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 15:27:23,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 15:27:23,922 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 15:27:23,922 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 15:27:23,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-14 15:27:23,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569e1db71/5ab05688b7a24e5dad276ad29314d816/FLAG4019dccfc [2021-12-14 15:27:24,292 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 15:27:24,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-14 15:27:24,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569e1db71/5ab05688b7a24e5dad276ad29314d816/FLAG4019dccfc [2021-12-14 15:27:24,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569e1db71/5ab05688b7a24e5dad276ad29314d816 [2021-12-14 15:27:24,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 15:27:24,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 15:27:24,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 15:27:24,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 15:27:24,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 15:27:24,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360e810c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24, skipping insertion in model container [2021-12-14 15:27:24,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 15:27:24,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 15:27:24,861 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/xcsp/AllInterval-005.c[2566,2579] [2021-12-14 15:27:24,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:27:24,869 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 15:27:24,883 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/xcsp/AllInterval-005.c[2566,2579] [2021-12-14 15:27:24,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:27:24,892 INFO L208 MainTranslator]: Completed translation [2021-12-14 15:27:24,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24 WrapperNode [2021-12-14 15:27:24,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 15:27:24,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 15:27:24,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 15:27:24,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 15:27:24,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,916 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-12-14 15:27:24,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 15:27:24,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 15:27:24,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 15:27:24,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 15:27:24,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 15:27:24,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 15:27:24,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 15:27:24,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 15:27:24,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (1/1) ... [2021-12-14 15:27:24,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:27:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:27:24,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 15:27:24,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 15:27:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 15:27:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 15:27:25,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 15:27:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 15:27:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-14 15:27:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-14 15:27:25,056 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 15:27:25,057 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 15:27:25,176 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 15:27:25,181 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 15:27:25,181 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 15:27:25,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:27:25 BoogieIcfgContainer [2021-12-14 15:27:25,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 15:27:25,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 15:27:25,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 15:27:25,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 15:27:25,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:27:24" (1/3) ... [2021-12-14 15:27:25,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7222d687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:27:25, skipping insertion in model container [2021-12-14 15:27:25,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:27:24" (2/3) ... [2021-12-14 15:27:25,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7222d687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:27:25, skipping insertion in model container [2021-12-14 15:27:25,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:27:25" (3/3) ... [2021-12-14 15:27:25,189 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2021-12-14 15:27:25,192 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 15:27:25,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 15:27:25,223 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 15:27:25,228 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 15:27:25,228 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 15:27:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-14 15:27:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-14 15:27:25,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:27:25,260 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:27:25,260 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:27:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:27:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2021-12-14 15:27:25,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:27:25,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110504226] [2021-12-14 15:27:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:27:25,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:27:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 15:27:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 15:27:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 15:27:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:27:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-14 15:27:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 15:27:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 15:27:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 15:27:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 15:27:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 15:27:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 15:27:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 15:27:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 15:27:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:27:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 15:27:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 15:27:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 15:27:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-14 15:27:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:27:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 15:27:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 15:27:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:27:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 15:27:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-14 15:27:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-14 15:27:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-14 15:27:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 15:27:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:27:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-14 15:27:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 15:27:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-14 15:27:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-14 15:27:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-14 15:27:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-14 15:27:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-14 15:27:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-14 15:27:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-14 15:27:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-14 15:27:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2021-12-14 15:27:25,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:27:25,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110504226] [2021-12-14 15:27:25,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110504226] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:27:25,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:27:25,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 15:27:25,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353623782] [2021-12-14 15:27:25,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:27:25,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 15:27:25,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:27:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 15:27:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 15:27:25,734 INFO L87 Difference]: Start difference. First operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-14 15:27:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:27:25,762 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2021-12-14 15:27:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 15:27:25,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 214 [2021-12-14 15:27:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:27:25,768 INFO L225 Difference]: With dead ends: 134 [2021-12-14 15:27:25,768 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 15:27:25,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 15:27:25,777 INFO L933 BasicCegarLoop]: 107 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, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:27:25,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:27:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 15:27:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-14 15:27:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-14 15:27:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2021-12-14 15:27:25,830 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2021-12-14 15:27:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:27:25,830 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2021-12-14 15:27:25,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-14 15:27:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2021-12-14 15:27:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-14 15:27:25,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:27:25,836 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:27:25,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 15:27:25,836 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:27:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:27:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2021-12-14 15:27:25,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:27:25,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80494628] [2021-12-14 15:27:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:27:25,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:27:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 15:27:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 15:27:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 15:27:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:27:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-14 15:27:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 15:27:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 15:27:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 15:27:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 15:27:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 15:27:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 15:27:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 15:27:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 15:27:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:27:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 15:27:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 15:27:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 15:27:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-14 15:27:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:27:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 15:27:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 15:27:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:27:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 15:27:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-14 15:27:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-14 15:27:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-14 15:27:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 15:27:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:27:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-14 15:27:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 15:27:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-14 15:27:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-14 15:27:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-14 15:27:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-14 15:27:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-14 15:27:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-14 15:27:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-14 15:27:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-14 15:27:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 483 proven. 357 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2021-12-14 15:27:27,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:27:27,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80494628] [2021-12-14 15:27:27,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80494628] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:27:27,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505678340] [2021-12-14 15:27:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:27:27,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:27:27,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:27:27,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:27:27,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 15:27:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:27,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-14 15:27:27,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:27:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 528 proven. 363 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-14 15:27:28,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 15:27:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 528 proven. 363 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-14 15:27:29,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505678340] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 15:27:29,866 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 15:27:29,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 26] total 59 [2021-12-14 15:27:29,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951723106] [2021-12-14 15:27:29,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 15:27:29,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-12-14 15:27:29,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:27:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-12-14 15:27:29,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3188, Unknown=0, NotChecked=0, Total=3422 [2021-12-14 15:27:29,870 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) [2021-12-14 15:27:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:27:33,045 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2021-12-14 15:27:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-14 15:27:33,045 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) Word has length 214 [2021-12-14 15:27:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:27:33,047 INFO L225 Difference]: With dead ends: 113 [2021-12-14 15:27:33,047 INFO L226 Difference]: Without dead ends: 109 [2021-12-14 15:27:33,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1457, Invalid=6199, Unknown=0, NotChecked=0, Total=7656 [2021-12-14 15:27:33,050 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 431 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:27:33,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 1759 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-14 15:27:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-14 15:27:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2021-12-14 15:27:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-14 15:27:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2021-12-14 15:27:33,063 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2021-12-14 15:27:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:27:33,064 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2021-12-14 15:27:33,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) [2021-12-14 15:27:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2021-12-14 15:27:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-14 15:27:33,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:27:33,067 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:27:33,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 15:27:33,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:27:33,268 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:27:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:27:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2021-12-14 15:27:33,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:27:33,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51054392] [2021-12-14 15:27:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:27:33,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:27:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 15:27:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 15:27:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 15:27:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:27:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-14 15:27:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 15:27:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 15:27:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 15:27:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-14 15:27:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 15:27:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 15:27:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 15:27:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-14 15:27:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:27:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 15:27:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 15:27:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 15:27:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-14 15:27:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-14 15:27:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-14 15:27:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-14 15:27:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 15:27:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 15:27:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-14 15:27:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-14 15:27:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-14 15:27:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-14 15:27:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 15:27:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-14 15:27:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-14 15:27:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-14 15:27:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-14 15:27:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-14 15:27:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-14 15:27:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-14 15:27:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-14 15:27:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-14 15:27:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-14 15:27:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 750 proven. 306 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2021-12-14 15:27:36,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:27:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51054392] [2021-12-14 15:27:36,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51054392] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:27:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781676317] [2021-12-14 15:27:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:27:36,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:27:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:27:36,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:27:36,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 15:27:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:27:36,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-14 15:27:36,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:27:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 691 proven. 315 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2021-12-14 15:27:38,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 15:27:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 543 proven. 348 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-14 15:27:40,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781676317] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 15:27:40,148 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 15:27:40,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 22] total 66 [2021-12-14 15:27:40,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010327095] [2021-12-14 15:27:40,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 15:27:40,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-12-14 15:27:40,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:27:40,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-12-14 15:27:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4010, Unknown=0, NotChecked=0, Total=4290 [2021-12-14 15:27:40,154 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) [2021-12-14 15:27:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:27:49,245 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-12-14 15:27:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-14 15:27:49,246 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) Word has length 214 [2021-12-14 15:27:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:27:49,252 INFO L225 Difference]: With dead ends: 113 [2021-12-14 15:27:49,252 INFO L226 Difference]: Without dead ends: 101 [2021-12-14 15:27:49,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2165, Invalid=8965, Unknown=0, NotChecked=0, Total=11130 [2021-12-14 15:27:49,256 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 458 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-14 15:27:49,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 2134 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-14 15:27:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-14 15:27:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2021-12-14 15:27:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2021-12-14 15:27:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2021-12-14 15:27:49,276 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2021-12-14 15:27:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:27:49,277 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2021-12-14 15:27:49,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) [2021-12-14 15:27:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2021-12-14 15:27:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-14 15:27:49,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:27:49,282 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:27:49,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 15:27:49,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-14 15:27:49,494 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:27:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:27:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2021-12-14 15:27:49,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:27:49,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501662637] [2021-12-14 15:27:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:27:49,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:27:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:27:49,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 15:27:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:27:49,599 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 15:27:49,599 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 15:27:49,600 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 15:27:49,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 15:27:49,603 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-14 15:27:49,606 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 15:27:49,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:27:49 BoogieIcfgContainer [2021-12-14 15:27:49,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 15:27:49,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 15:27:49,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 15:27:49,677 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 15:27:49,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:27:25" (3/4) ... [2021-12-14 15:27:49,678 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 15:27:49,746 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 15:27:49,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 15:27:49,747 INFO L158 Benchmark]: Toolchain (without parser) took 25033.16ms. Allocated memory was 94.4MB in the beginning and 201.3MB in the end (delta: 107.0MB). Free memory was 63.9MB in the beginning and 143.5MB in the end (delta: -79.6MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2021-12-14 15:27:49,747 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 15:27:49,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.54ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 70.0MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 15:27:49,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.55ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 15:27:49,748 INFO L158 Benchmark]: Boogie Preprocessor took 28.67ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 67.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 15:27:49,748 INFO L158 Benchmark]: RCFGBuilder took 236.83ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 55.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 15:27:49,748 INFO L158 Benchmark]: TraceAbstraction took 24491.98ms. Allocated memory was 94.4MB in the beginning and 201.3MB in the end (delta: 107.0MB). Free memory was 55.0MB in the beginning and 150.8MB in the end (delta: -95.8MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2021-12-14 15:27:49,748 INFO L158 Benchmark]: Witness Printer took 69.76ms. Allocated memory is still 201.3MB. Free memory was 150.8MB in the beginning and 143.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 15:27:49,750 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.54ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 70.0MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.55ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.67ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 67.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 236.83ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 55.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24491.98ms. Allocated memory was 94.4MB in the beginning and 201.3MB in the end (delta: 107.0MB). Free memory was 55.0MB in the beginning and 150.8MB in the end (delta: -95.8MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. * Witness Printer took 69.76ms. Allocated memory is still 201.3MB. Free memory was 150.8MB in the beginning and 143.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 93]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=3] [L30] CALL assume(var0 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 4) VAL [dummy=0, var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=3, var1=2] [L34] CALL assume(var1 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 4) VAL [dummy=0, var0=3, var1=2] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0] [L38] CALL assume(var2 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L42] CALL assume(var3 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L46] CALL assume(var4 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L50] CALL assume(var5 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L54] CALL assume(var6 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L58] CALL assume(var7 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L62] CALL assume(var8 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L63] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L64] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L65] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L66] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L67] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L68] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L69] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L70] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L71] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L72] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L73] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L74] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L75] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L76] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L77] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L78] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L79] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L80] int var_for_abs; [L81] var_for_abs = var0 - var1 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=1, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L83] CALL assume(var5 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var5 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L84] var_for_abs = var1 - var2 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=2, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L86] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L87] var_for_abs = var2 - var3 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=4, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L89] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L90] var_for_abs = var3 - var4 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=3, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L92] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L93] reach_error() VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 895 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 4000 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3757 mSDsCounter, 1144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4281 IncrementalHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1144 mSolverCounterUnsat, 243 mSDtfsCounter, 4281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1273 GetRequests, 1082 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 85, 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, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 11400 SizeOfPredicates, 66 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17632/19684 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 15:27:49,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE