./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 35987657 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-?-3598765 [2022-07-21 06:21:29,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 06:21:29,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 06:21:29,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 06:21:29,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 06:21:29,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 06:21:29,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 06:21:29,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 06:21:29,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 06:21:29,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 06:21:29,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 06:21:29,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 06:21:29,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 06:21:29,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 06:21:29,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 06:21:29,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 06:21:29,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 06:21:29,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 06:21:29,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 06:21:29,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 06:21:29,435 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 06:21:29,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 06:21:29,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 06:21:29,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 06:21:29,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 06:21:29,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 06:21:29,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 06:21:29,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 06:21:29,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 06:21:29,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 06:21:29,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 06:21:29,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 06:21:29,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 06:21:29,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 06:21:29,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 06:21:29,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 06:21:29,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 06:21:29,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 06:21:29,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 06:21:29,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 06:21:29,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 06:21:29,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 06:21:29,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 06:21:29,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 06:21:29,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 06:21:29,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 06:21:29,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 06:21:29,476 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 06:21:29,476 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 06:21:29,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 06:21:29,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 06:21:29,477 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 06:21:29,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 06:21:29,478 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 06:21:29,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 06:21:29,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 06:21:29,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 06:21:29,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 06:21:29,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 06:21:29,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 06:21:29,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 06:21:29,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 06:21:29,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 06:21:29,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 06:21:29,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 06:21:29,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 06:21:29,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 06:21:29,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:21:29,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 06:21:29,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 06:21:29,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 06:21:29,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 06:21:29,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 06:21:29,485 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 06:21:29,485 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 06:21:29,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 06:21:29,486 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 [2022-07-21 06:21:29,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 06:21:29,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 06:21:29,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 06:21:29,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 06:21:29,766 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 06:21:29,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-005.c [2022-07-21 06:21:29,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374024a9/910a339c019c4102b6e23cf4c51a5dc2/FLAG47ceef95f [2022-07-21 06:21:30,177 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 06:21:30,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2022-07-21 06:21:30,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374024a9/910a339c019c4102b6e23cf4c51a5dc2/FLAG47ceef95f [2022-07-21 06:21:30,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374024a9/910a339c019c4102b6e23cf4c51a5dc2 [2022-07-21 06:21:30,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 06:21:30,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 06:21:30,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 06:21:30,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 06:21:30,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 06:21:30,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16aee570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30, skipping insertion in model container [2022-07-21 06:21:30,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 06:21:30,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 06:21:30,326 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] [2022-07-21 06:21:30,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:21:30,334 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 06:21:30,385 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] [2022-07-21 06:21:30,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:21:30,395 INFO L208 MainTranslator]: Completed translation [2022-07-21 06:21:30,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30 WrapperNode [2022-07-21 06:21:30,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 06:21:30,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 06:21:30,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 06:21:30,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 06:21:30,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,418 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-07-21 06:21:30,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 06:21:30,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 06:21:30,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 06:21:30,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 06:21:30,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 06:21:30,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 06:21:30,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 06:21:30,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 06:21:30,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (1/1) ... [2022-07-21 06:21:30,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:21:30,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:30,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 06:21:30,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 06:21:30,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 06:21:30,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 06:21:30,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 06:21:30,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 06:21:30,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-07-21 06:21:30,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-07-21 06:21:30,578 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 06:21:30,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 06:21:30,725 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 06:21:30,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 06:21:30,737 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 06:21:30,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:21:30 BoogieIcfgContainer [2022-07-21 06:21:30,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 06:21:30,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 06:21:30,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 06:21:30,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 06:21:30,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 06:21:30" (1/3) ... [2022-07-21 06:21:30,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c193c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:21:30, skipping insertion in model container [2022-07-21 06:21:30,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:21:30" (2/3) ... [2022-07-21 06:21:30,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c193c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:21:30, skipping insertion in model container [2022-07-21 06:21:30,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:21:30" (3/3) ... [2022-07-21 06:21:30,751 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2022-07-21 06:21:30,775 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 06:21:30,775 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 06:21:30,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 06:21:30,842 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@93558f2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49b86d36 [2022-07-21 06:21:30,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 06:21:30,853 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) [2022-07-21 06:21:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 06:21:30,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:30,880 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:21:30,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2022-07-21 06:21:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:30,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712629550] [2022-07-21 06:21:30,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:21:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:21:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 06:21:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:21:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 06:21:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 06:21:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:21:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 06:21:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 06:21:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 06:21:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 06:21:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 06:21:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 06:21:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 06:21:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 06:21:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 06:21:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 06:21:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 06:21:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 06:21:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 06:21:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 06:21:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 06:21:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 06:21:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 06:21:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 06:21:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 06:21:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 06:21:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 06:21:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:21:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 06:21:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 06:21:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 06:21:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 06:21:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 06:21:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2022-07-21 06:21:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:31,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712629550] [2022-07-21 06:21:31,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712629550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:31,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:21:31,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 06:21:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238530053] [2022-07-21 06:21:31,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 06:21:31,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:31,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 06:21:31,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 06:21:31,269 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) [2022-07-21 06:21:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:31,310 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2022-07-21 06:21:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 06:21:31,312 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 [2022-07-21 06:21:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:31,320 INFO L225 Difference]: With dead ends: 134 [2022-07-21 06:21:31,320 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 06:21:31,327 INFO L412 NwaCegarLoop]: 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 [2022-07-21 06:21:31,331 INFO L413 NwaCegarLoop]: 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 [2022-07-21 06:21:31,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:21:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 06:21:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-07-21 06:21:31,381 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) [2022-07-21 06:21:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2022-07-21 06:21:31,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2022-07-21 06:21:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:31,385 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2022-07-21 06:21:31,386 INFO L496 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) [2022-07-21 06:21:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2022-07-21 06:21:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 06:21:31,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:31,395 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:21:31,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 06:21:31,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2022-07-21 06:21:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:31,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134271808] [2022-07-21 06:21:31,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:21:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:21:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 06:21:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:21:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 06:21:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 06:21:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:21:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 06:21:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 06:21:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 06:21:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 06:21:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 06:21:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 06:21:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 06:21:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 06:21:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 06:21:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 06:21:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 06:21:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 06:21:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 06:21:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 06:21:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 06:21:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 06:21:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 06:21:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 06:21:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 06:21:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 06:21:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 06:21:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:21:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 06:21:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 06:21:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 06:21:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 06:21:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 06:21:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 507 proven. 333 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2022-07-21 06:21:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:32,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134271808] [2022-07-21 06:21:32,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134271808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:32,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324202063] [2022-07-21 06:21:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:32,824 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) [2022-07-21 06:21:32,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 06:21:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-21 06:21:32,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-07-21 06:21:34,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-07-21 06:21:35,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324202063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:35,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:35,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 25] total 64 [2022-07-21 06:21:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135760696] [2022-07-21 06:21:35,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:35,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-21 06:21:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-21 06:21:35,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=3754, Unknown=0, NotChecked=0, Total=4032 [2022-07-21 06:21:35,297 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 64 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 50 states have internal predecessors, (70), 36 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (104), 33 states have call predecessors, (104), 36 states have call successors, (104) [2022-07-21 06:21:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:39,751 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2022-07-21 06:21:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-21 06:21:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 50 states have internal predecessors, (70), 36 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (104), 33 states have call predecessors, (104), 36 states have call successors, (104) Word has length 214 [2022-07-21 06:21:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:39,754 INFO L225 Difference]: With dead ends: 113 [2022-07-21 06:21:39,754 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 06:21:39,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 475 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1558, Invalid=6814, Unknown=0, NotChecked=0, Total=8372 [2022-07-21 06:21:39,757 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 293 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 3598 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 3598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:39,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 961 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 3598 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 06:21:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 06:21:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2022-07-21 06:21:39,774 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) [2022-07-21 06:21:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2022-07-21 06:21:39,775 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2022-07-21 06:21:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:39,776 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2022-07-21 06:21:39,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 50 states have internal predecessors, (70), 36 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (104), 33 states have call predecessors, (104), 36 states have call successors, (104) [2022-07-21 06:21:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2022-07-21 06:21:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 06:21:39,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:39,778 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:21:39,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 06:21:39,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:39,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2022-07-21 06:21:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:39,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259105773] [2022-07-21 06:21:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:21:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:21:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 06:21:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:21:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 06:21:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 06:21:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:21:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 06:21:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 06:21:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 06:21:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 06:21:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 06:21:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 06:21:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 06:21:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 06:21:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 06:21:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 06:21:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 06:21:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 06:21:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 06:21:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 06:21:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 06:21:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 06:21:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 06:21:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 06:21:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 06:21:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 06:21:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 06:21:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:21:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 06:21:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 06:21:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 06:21:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 06:21:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 06:21:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 597 proven. 294 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-07-21 06:21:41,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:41,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259105773] [2022-07-21 06:21:41,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259105773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006612315] [2022-07-21 06:21:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:41,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:41,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:41,460 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) [2022-07-21 06:21:41,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 06:21:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:41,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-21 06:21:41,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 724 proven. 282 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-07-21 06:21:42,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 576 proven. 315 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-07-21 06:21:44,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006612315] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:44,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:44,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 61 [2022-07-21 06:21:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280078791] [2022-07-21 06:21:44,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-21 06:21:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:44,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-21 06:21:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3368, Unknown=0, NotChecked=0, Total=3660 [2022-07-21 06:21:44,980 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 61 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 42 states have internal predecessors, (71), 38 states have call successors, (109), 2 states have call predecessors, (109), 3 states have return successors, (110), 34 states have call predecessors, (110), 38 states have call successors, (110) [2022-07-21 06:21:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:55,929 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2022-07-21 06:21:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-21 06:21:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 42 states have internal predecessors, (71), 38 states have call successors, (109), 2 states have call predecessors, (109), 3 states have return successors, (110), 34 states have call predecessors, (110), 38 states have call successors, (110) Word has length 214 [2022-07-21 06:21:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:55,931 INFO L225 Difference]: With dead ends: 113 [2022-07-21 06:21:55,931 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 06:21:55,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1717, Invalid=7025, Unknown=0, NotChecked=0, Total=8742 [2022-07-21 06:21:55,934 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 226 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:55,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 862 Invalid, 3533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 2929 Invalid, 0 Unknown, 281 Unchecked, 1.8s Time] [2022-07-21 06:21:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 06:21:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2022-07-21 06:21:55,953 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) [2022-07-21 06:21:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2022-07-21 06:21:55,955 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2022-07-21 06:21:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:55,957 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2022-07-21 06:21:55,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 42 states have internal predecessors, (71), 38 states have call successors, (109), 2 states have call predecessors, (109), 3 states have return successors, (110), 34 states have call predecessors, (110), 38 states have call successors, (110) [2022-07-21 06:21:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-07-21 06:21:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 06:21:55,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:55,961 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:21:55,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:56,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-21 06:21:56,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2022-07-21 06:21:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:56,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561075393] [2022-07-21 06:21:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 06:21:56,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 06:21:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 06:21:56,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 06:21:56,401 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 06:21:56,403 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 06:21:56,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 06:21:56,408 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-21 06:21:56,411 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 06:21:56,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 06:21:56 BoogieIcfgContainer [2022-07-21 06:21:56,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 06:21:56,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 06:21:56,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 06:21:56,486 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 06:21:56,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:21:30" (3/4) ... [2022-07-21 06:21:56,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 06:21:56,561 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 06:21:56,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 06:21:56,561 INFO L158 Benchmark]: Toolchain (without parser) took 26364.64ms. Allocated memory was 48.2MB in the beginning and 234.9MB in the end (delta: 186.6MB). Free memory was 23.8MB in the beginning and 148.0MB in the end (delta: -124.1MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2022-07-21 06:21:56,562 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 06:21:56,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.31ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.6MB in the beginning and 41.7MB in the end (delta: -18.1MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2022-07-21 06:21:56,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.95ms. Allocated memory is still 58.7MB. Free memory was 41.5MB in the beginning and 39.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 06:21:56,562 INFO L158 Benchmark]: Boogie Preprocessor took 11.77ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 38.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 06:21:56,563 INFO L158 Benchmark]: RCFGBuilder took 314.33ms. Allocated memory is still 58.7MB. Free memory was 38.7MB in the beginning and 39.9MB in the end (delta: -1.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-07-21 06:21:56,563 INFO L158 Benchmark]: TraceAbstraction took 25737.98ms. Allocated memory was 58.7MB in the beginning and 234.9MB in the end (delta: 176.2MB). Free memory was 39.5MB in the beginning and 155.3MB in the end (delta: -115.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-07-21 06:21:56,563 INFO L158 Benchmark]: Witness Printer took 75.65ms. Allocated memory is still 234.9MB. Free memory was 155.3MB in the beginning and 148.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 06:21:56,565 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 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.31ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.6MB in the beginning and 41.7MB in the end (delta: -18.1MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.95ms. Allocated memory is still 58.7MB. Free memory was 41.5MB in the beginning and 39.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.77ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 38.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.33ms. Allocated memory is still 58.7MB. Free memory was 38.7MB in the beginning and 39.9MB in the end (delta: -1.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25737.98ms. Allocated memory was 58.7MB in the beginning and 234.9MB in the end (delta: 176.2MB). Free memory was 39.5MB in the beginning and 155.3MB in the end (delta: -115.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Witness Printer took 75.65ms. Allocated memory is still 234.9MB. Free memory was 155.3MB in the beginning and 148.0MB 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: 25.6s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 519 mSDsluCounter, 1930 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 281 IncrementalHoareTripleChecker+Unchecked, 1675 mSDsCounter, 727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6527 IncrementalHoareTripleChecker+Invalid, 7535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 727 mSolverCounterUnsat, 255 mSDtfsCounter, 6527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1253 GetRequests, 1070 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 79, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 3 QuantifiedInterpolants, 11209 SizeOfPredicates, 67 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17746/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! [2022-07-21 06:21:56,613 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