./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 ae007674 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-dev-ae00767 [2021-12-28 01:40:10,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 01:40:10,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 01:40:10,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 01:40:10,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 01:40:10,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 01:40:10,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 01:40:10,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 01:40:10,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 01:40:10,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 01:40:10,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 01:40:10,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 01:40:10,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 01:40:10,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 01:40:10,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 01:40:10,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 01:40:10,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 01:40:10,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 01:40:10,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 01:40:10,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 01:40:10,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 01:40:10,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 01:40:10,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 01:40:10,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 01:40:10,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 01:40:10,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 01:40:10,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 01:40:10,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 01:40:10,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 01:40:10,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 01:40:10,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 01:40:10,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 01:40:10,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 01:40:10,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 01:40:10,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 01:40:10,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 01:40:10,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 01:40:10,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 01:40:10,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 01:40:10,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 01:40:10,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 01:40:10,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 01:40:10,196 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 01:40:10,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 01:40:10,197 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 01:40:10,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 01:40:10,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 01:40:10,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 01:40:10,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 01:40:10,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 01:40:10,200 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 01:40:10,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 01:40:10,201 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 01:40:10,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 01:40:10,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 01:40:10,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 01:40:10,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 01:40:10,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 01:40:10,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 01:40:10,203 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 01:40:10,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 01:40:10,203 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 01:40:10,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 01:40:10,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 01:40:10,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 01:40:10,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 01:40:10,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:40:10,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 01:40:10,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 01:40:10,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 01:40:10,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 01:40:10,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 01:40:10,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 01:40:10,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 01:40:10,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 01:40:10,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 [2021-12-28 01:40:10,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 01:40:10,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 01:40:10,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 01:40:10,536 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 01:40:10,536 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 01:40:10,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-28 01:40:10,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011aec91c/d64a18020cc840089daafb5c627e2825/FLAG28204d54d [2021-12-28 01:40:10,980 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 01:40:10,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-28 01:40:10,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011aec91c/d64a18020cc840089daafb5c627e2825/FLAG28204d54d [2021-12-28 01:40:11,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011aec91c/d64a18020cc840089daafb5c627e2825 [2021-12-28 01:40:11,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 01:40:11,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 01:40:11,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 01:40:11,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 01:40:11,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 01:40:11,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd2f683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11, skipping insertion in model container [2021-12-28 01:40:11,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 01:40:11,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 01:40:11,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2021-12-28 01:40:11,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:40:11,564 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 01:40:11,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2021-12-28 01:40:11,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:40:11,622 INFO L208 MainTranslator]: Completed translation [2021-12-28 01:40:11,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11 WrapperNode [2021-12-28 01:40:11,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 01:40:11,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 01:40:11,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 01:40:11,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 01:40:11,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,651 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-12-28 01:40:11,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 01:40:11,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 01:40:11,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 01:40:11,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 01:40:11,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 01:40:11,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 01:40:11,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 01:40:11,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 01:40:11,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (1/1) ... [2021-12-28 01:40:11,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:40:11,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:11,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 01:40:11,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 01:40:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 01:40:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 01:40:11,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 01:40:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 01:40:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-28 01:40:11,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-28 01:40:11,806 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 01:40:11,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 01:40:12,025 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 01:40:12,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 01:40:12,044 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 01:40:12,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:40:12 BoogieIcfgContainer [2021-12-28 01:40:12,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 01:40:12,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 01:40:12,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 01:40:12,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 01:40:12,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:40:11" (1/3) ... [2021-12-28 01:40:12,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148d3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:40:12, skipping insertion in model container [2021-12-28 01:40:12,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:40:11" (2/3) ... [2021-12-28 01:40:12,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148d3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:40:12, skipping insertion in model container [2021-12-28 01:40:12,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:40:12" (3/3) ... [2021-12-28 01:40:12,052 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2021-12-28 01:40:12,071 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 01:40:12,071 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 01:40:12,143 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 01:40:12,148 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 01:40:12,163 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 01:40:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-28 01:40:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-28 01:40:12,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:12,217 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:40:12,217 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2021-12-28 01:40:12,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:12,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664990412] [2021-12-28 01:40:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:12,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:40:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 01:40:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 01:40:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:40:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-28 01:40:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 01:40:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 01:40:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:40:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:40:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 01:40:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 01:40:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 01:40:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:40:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 01:40:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 01:40:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:40:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 01:40:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-28 01:40:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 01:40:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 01:40:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 01:40:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:40:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-28 01:40:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 01:40:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 01:40:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 01:40:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 01:40:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-28 01:40:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 01:40:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-28 01:40:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-28 01:40:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-28 01:40:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-28 01:40:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-28 01:40:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-28 01:40:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-28 01:40:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-28 01:40:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2021-12-28 01:40:12,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:12,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664990412] [2021-12-28 01:40:12,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664990412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:40:12,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:40:12,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 01:40:12,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407830810] [2021-12-28 01:40:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:40:12,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 01:40:12,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:12,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 01:40:12,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 01:40:12,877 INFO L87 Difference]: Start difference. First operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-28 01:40:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:12,931 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2021-12-28 01:40:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 01:40:12,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 214 [2021-12-28 01:40:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:12,941 INFO L225 Difference]: With dead ends: 134 [2021-12-28 01:40:12,941 INFO L226 Difference]: Without dead ends: 67 [2021-12-28 01:40:12,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 01:40:12,953 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:40:12,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:40:12,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-28 01:40:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-28 01:40:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-28 01:40:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2021-12-28 01:40:13,006 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2021-12-28 01:40:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:13,006 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2021-12-28 01:40:13,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-28 01:40:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2021-12-28 01:40:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-28 01:40:13,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:13,014 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:40:13,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 01:40:13,015 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:13,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2021-12-28 01:40:13,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:13,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888077239] [2021-12-28 01:40:13,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:13,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:40:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 01:40:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 01:40:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:40:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-28 01:40:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 01:40:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 01:40:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:40:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:40:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 01:40:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 01:40:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 01:40:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:40:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 01:40:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 01:40:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:40:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 01:40:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-28 01:40:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 01:40:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 01:40:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 01:40:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:40:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-28 01:40:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 01:40:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 01:40:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 01:40:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 01:40:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-28 01:40:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 01:40:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-28 01:40:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-28 01:40:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-28 01:40:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-28 01:40:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-28 01:40:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-28 01:40:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-28 01:40:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-28 01:40:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 432 proven. 351 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2021-12-28 01:40:14,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:14,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888077239] [2021-12-28 01:40:14,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888077239] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:14,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596232427] [2021-12-28 01:40:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:14,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:14,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:40:14,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 01:40:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:14,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-28 01:40:14,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-28 01:40:16,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:40:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-28 01:40:18,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596232427] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:40:18,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:40:18,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 61 [2021-12-28 01:40:18,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725002452] [2021-12-28 01:40:18,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:40:18,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-28 01:40:18,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-28 01:40:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3388, Unknown=0, NotChecked=0, Total=3660 [2021-12-28 01:40:18,446 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) [2021-12-28 01:40:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:22,129 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2021-12-28 01:40:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-28 01:40:22,130 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) Word has length 214 [2021-12-28 01:40:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:22,133 INFO L225 Difference]: With dead ends: 117 [2021-12-28 01:40:22,133 INFO L226 Difference]: Without dead ends: 109 [2021-12-28 01:40:22,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1427, Invalid=6229, Unknown=0, NotChecked=0, Total=7656 [2021-12-28 01:40:22,137 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 401 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-28 01:40:22,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 1845 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 01:40:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-28 01:40:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2021-12-28 01:40:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-28 01:40:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2021-12-28 01:40:22,162 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2021-12-28 01:40:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:22,163 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2021-12-28 01:40:22,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) [2021-12-28 01:40:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2021-12-28 01:40:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-28 01:40:22,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:22,167 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:40:22,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:22,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:22,381 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2021-12-28 01:40:22,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:22,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216225935] [2021-12-28 01:40:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:22,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:40:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 01:40:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 01:40:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:40:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-28 01:40:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 01:40:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 01:40:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:40:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:40:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 01:40:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 01:40:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 01:40:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:40:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 01:40:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 01:40:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:40:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 01:40:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-28 01:40:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 01:40:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 01:40:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 01:40:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:40:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-28 01:40:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 01:40:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 01:40:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 01:40:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 01:40:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-28 01:40:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 01:40:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-28 01:40:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-28 01:40:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-28 01:40:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-28 01:40:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-28 01:40:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-28 01:40:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-28 01:40:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-28 01:40:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 573 proven. 318 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-28 01:40:23,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:23,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216225935] [2021-12-28 01:40:23,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216225935] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:23,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956436604] [2021-12-28 01:40:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:23,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:23,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:23,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:40:23,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 01:40:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-28 01:40:23,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 724 proven. 282 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2021-12-28 01:40:27,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:40:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 576 proven. 315 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-28 01:40:30,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956436604] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:40:30,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:40:30,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 58 [2021-12-28 01:40:30,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996880912] [2021-12-28 01:40:30,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:40:30,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-28 01:40:30,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-28 01:40:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3034, Unknown=1, NotChecked=0, Total=3306 [2021-12-28 01:40:30,464 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) [2021-12-28 01:40:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:38,901 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-12-28 01:40:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-28 01:40:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) Word has length 214 [2021-12-28 01:40:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:38,904 INFO L225 Difference]: With dead ends: 113 [2021-12-28 01:40:38,904 INFO L226 Difference]: Without dead ends: 101 [2021-12-28 01:40:38,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1462, Invalid=6019, Unknown=1, NotChecked=0, Total=7482 [2021-12-28 01:40:38,906 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 314 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:40:38,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1694 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1590 Invalid, 0 Unknown, 119 Unchecked, 1.3s Time] [2021-12-28 01:40:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-28 01:40:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2021-12-28 01:40:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2021-12-28 01:40:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2021-12-28 01:40:38,923 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2021-12-28 01:40:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:38,924 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2021-12-28 01:40:38,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) [2021-12-28 01:40:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2021-12-28 01:40:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-28 01:40:38,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:38,927 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:40:38,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:39,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-28 01:40:39,148 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2021-12-28 01:40:39,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:39,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406881905] [2021-12-28 01:40:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:39,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:40:39,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 01:40:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:40:39,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 01:40:39,390 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 01:40:39,391 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 01:40:39,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 01:40:39,396 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-28 01:40:39,399 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 01:40:39,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:40:39 BoogieIcfgContainer [2021-12-28 01:40:39,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 01:40:39,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 01:40:39,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 01:40:39,493 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 01:40:39,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:40:12" (3/4) ... [2021-12-28 01:40:39,495 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 01:40:39,584 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 01:40:39,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 01:40:39,585 INFO L158 Benchmark]: Toolchain (without parser) took 28171.76ms. Allocated memory was 54.5MB in the beginning and 119.5MB in the end (delta: 65.0MB). Free memory was 34.1MB in the beginning and 76.2MB in the end (delta: -42.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2021-12-28 01:40:39,585 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:40:39,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.10ms. Allocated memory is still 54.5MB. Free memory was 33.8MB in the beginning and 37.7MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 01:40:39,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.54ms. Allocated memory is still 54.5MB. Free memory was 37.7MB in the beginning and 35.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:40:39,586 INFO L158 Benchmark]: Boogie Preprocessor took 16.48ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 34.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 01:40:39,586 INFO L158 Benchmark]: RCFGBuilder took 376.35ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 34.7MB in the beginning and 48.6MB in the end (delta: -13.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2021-12-28 01:40:39,587 INFO L158 Benchmark]: TraceAbstraction took 27444.98ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 48.0MB in the beginning and 84.5MB in the end (delta: -36.6MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2021-12-28 01:40:39,587 INFO L158 Benchmark]: Witness Printer took 91.76ms. Allocated memory is still 119.5MB. Free memory was 83.5MB in the beginning and 76.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-28 01:40:39,588 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.18ms. Allocated memory is still 54.5MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.10ms. Allocated memory is still 54.5MB. Free memory was 33.8MB in the beginning and 37.7MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.54ms. Allocated memory is still 54.5MB. Free memory was 37.7MB in the beginning and 35.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.48ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 34.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.35ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 34.7MB in the beginning and 48.6MB in the end (delta: -13.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27444.98ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 48.0MB in the beginning and 84.5MB in the end (delta: -36.6MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. * Witness Printer took 91.76ms. Allocated memory is still 119.5MB. Free memory was 83.5MB in the beginning and 76.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 27.3s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 723 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 3646 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 119 IncrementalHoareTripleChecker+Unchecked, 3404 mSDsCounter, 821 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3546 IncrementalHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 821 mSolverCounterUnsat, 242 mSDtfsCounter, 3546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1243 GetRequests, 1071 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2357 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 3 QuantifiedInterpolants, 10227 SizeOfPredicates, 67 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17704/19684 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-28 01:40:39,619 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