./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/ldv-regression/test22-1.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 a3b319f31812cf6dfaa3cae4a89a0875c72839a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 02:10:19,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 02:10:19,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 02:10:19,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 02:10:19,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 02:10:19,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 02:10:19,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 02:10:19,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 02:10:19,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 02:10:19,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 02:10:19,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 02:10:19,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 02:10:19,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 02:10:19,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 02:10:19,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 02:10:19,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 02:10:19,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 02:10:19,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 02:10:19,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 02:10:19,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 02:10:19,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 02:10:19,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 02:10:19,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 02:10:19,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 02:10:19,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 02:10:19,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 02:10:19,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 02:10:19,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 02:10:19,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 02:10:19,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 02:10:19,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 02:10:19,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 02:10:19,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 02:10:19,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 02:10:19,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 02:10:19,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 02:10:19,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 02:10:19,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 02:10:19,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 02:10:19,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 02:10:19,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 02:10:19,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 02:10:19,981 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 02:10:19,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 02:10:19,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 02:10:19,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 02:10:19,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 02:10:19,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 02:10:19,984 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 02:10:19,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 02:10:19,984 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 02:10:19,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 02:10:19,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 02:10:19,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 02:10:19,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 02:10:19,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 02:10:19,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 02:10:19,986 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 02:10:19,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 02:10:19,986 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 02:10:19,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 02:10:19,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 02:10:19,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 02:10:19,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 02:10:19,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:10:19,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 02:10:19,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 02:10:19,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 02:10:19,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 02:10:19,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 02:10:19,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 02:10:19,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 02:10:19,987 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 -> a3b319f31812cf6dfaa3cae4a89a0875c72839a3 [2021-08-26 02:10:20,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 02:10:20,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 02:10:20,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 02:10:20,262 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 02:10:20,262 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 02:10:20,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2021-08-26 02:10:20,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de7e0741/d12bee33243c435898a488807177539d/FLAGc0f5cba95 [2021-08-26 02:10:20,614 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 02:10:20,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2021-08-26 02:10:20,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de7e0741/d12bee33243c435898a488807177539d/FLAGc0f5cba95 [2021-08-26 02:10:21,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de7e0741/d12bee33243c435898a488807177539d [2021-08-26 02:10:21,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 02:10:21,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 02:10:21,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 02:10:21,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 02:10:21,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 02:10:21,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43218cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21, skipping insertion in model container [2021-08-26 02:10:21,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 02:10:21,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 02:10:21,143 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2021-08-26 02:10:21,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:10:21,149 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 02:10:21,160 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2021-08-26 02:10:21,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:10:21,187 INFO L208 MainTranslator]: Completed translation [2021-08-26 02:10:21,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21 WrapperNode [2021-08-26 02:10:21,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 02:10:21,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 02:10:21,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 02:10:21,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 02:10:21,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 02:10:21,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 02:10:21,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 02:10:21,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 02:10:21,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 02:10:21,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 02:10:21,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 02:10:21,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 02:10:21,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (1/1) ... [2021-08-26 02:10:21,272 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:10:21,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:10:21,290 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-08-26 02:10:21,312 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-08-26 02:10:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 02:10:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 02:10:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 02:10:21,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 02:10:21,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 02:10:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 02:10:21,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 02:10:21,664 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-08-26 02:10:21,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:10:21 BoogieIcfgContainer [2021-08-26 02:10:21,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 02:10:21,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 02:10:21,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 02:10:21,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 02:10:21,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:10:21" (1/3) ... [2021-08-26 02:10:21,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1369f4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:10:21, skipping insertion in model container [2021-08-26 02:10:21,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:10:21" (2/3) ... [2021-08-26 02:10:21,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1369f4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:10:21, skipping insertion in model container [2021-08-26 02:10:21,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:10:21" (3/3) ... [2021-08-26 02:10:21,671 INFO L111 eAbstractionObserver]: Analyzing ICFG test22-1.c [2021-08-26 02:10:21,674 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 02:10:21,674 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 02:10:21,712 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 02:10:21,718 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 02:10:21,719 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 02:10:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 02:10:21,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:21,739 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:21,740 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash 164664103, now seen corresponding path program 1 times [2021-08-26 02:10:21,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:21,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298375979] [2021-08-26 02:10:21,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:21,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:21,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:21,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298375979] [2021-08-26 02:10:21,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298375979] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:10:21,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:10:21,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 02:10:21,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712679510] [2021-08-26 02:10:21,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 02:10:21,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 02:10:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 02:10:21,929 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:21,938 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2021-08-26 02:10:21,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 02:10:21,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 02:10:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:21,943 INFO L225 Difference]: With dead ends: 34 [2021-08-26 02:10:21,943 INFO L226 Difference]: Without dead ends: 21 [2021-08-26 02:10:21,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 02:10:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-08-26 02:10:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-08-26 02:10:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-08-26 02:10:21,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2021-08-26 02:10:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:21,966 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-26 02:10:21,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-08-26 02:10:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 02:10:21,968 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:21,968 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:21,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 02:10:21,971 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash 603612068, now seen corresponding path program 1 times [2021-08-26 02:10:21,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:21,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414241414] [2021-08-26 02:10:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:21,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:22,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:22,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414241414] [2021-08-26 02:10:22,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414241414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:10:22,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:10:22,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 02:10:22,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603300874] [2021-08-26 02:10:22,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 02:10:22,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:22,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 02:10:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 02:10:22,214 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:22,539 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2021-08-26 02:10:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 02:10:22,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 02:10:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:22,542 INFO L225 Difference]: With dead ends: 96 [2021-08-26 02:10:22,543 INFO L226 Difference]: Without dead ends: 91 [2021-08-26 02:10:22,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 260.7ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-08-26 02:10:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-26 02:10:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 33. [2021-08-26 02:10:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2021-08-26 02:10:22,559 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2021-08-26 02:10:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:22,560 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-08-26 02:10:22,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2021-08-26 02:10:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 02:10:22,561 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:22,562 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:22,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 02:10:22,562 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash -407505182, now seen corresponding path program 1 times [2021-08-26 02:10:22,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:22,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339423409] [2021-08-26 02:10:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:22,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:22,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:22,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339423409] [2021-08-26 02:10:22,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339423409] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:10:22,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:10:22,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 02:10:22,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829564246] [2021-08-26 02:10:22,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 02:10:22,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 02:10:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-26 02:10:22,699 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:22,956 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2021-08-26 02:10:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-26 02:10:22,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 02:10:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:22,959 INFO L225 Difference]: With dead ends: 91 [2021-08-26 02:10:22,959 INFO L226 Difference]: Without dead ends: 66 [2021-08-26 02:10:22,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 154.2ms TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2021-08-26 02:10:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-26 02:10:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2021-08-26 02:10:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-08-26 02:10:22,963 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2021-08-26 02:10:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:22,963 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-08-26 02:10:22,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-08-26 02:10:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 02:10:22,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:22,964 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:22,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 02:10:22,964 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash -984735834, now seen corresponding path program 1 times [2021-08-26 02:10:22,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:22,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576368548] [2021-08-26 02:10:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:22,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:23,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:23,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576368548] [2021-08-26 02:10:23,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576368548] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:10:23,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:10:23,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 02:10:23,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964686476] [2021-08-26 02:10:23,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 02:10:23,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 02:10:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 02:10:23,047 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:23,274 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2021-08-26 02:10:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 02:10:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 02:10:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:23,276 INFO L225 Difference]: With dead ends: 81 [2021-08-26 02:10:23,276 INFO L226 Difference]: Without dead ends: 64 [2021-08-26 02:10:23,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 146.1ms TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-08-26 02:10:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-26 02:10:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2021-08-26 02:10:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-08-26 02:10:23,280 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2021-08-26 02:10:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:23,280 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-08-26 02:10:23,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-08-26 02:10:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 02:10:23,281 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:23,281 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:23,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 02:10:23,281 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1995853084, now seen corresponding path program 1 times [2021-08-26 02:10:23,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:23,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609586542] [2021-08-26 02:10:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:23,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:23,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:23,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609586542] [2021-08-26 02:10:23,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609586542] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:10:23,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:10:23,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 02:10:23,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197986520] [2021-08-26 02:10:23,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 02:10:23,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:23,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 02:10:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 02:10:23,418 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:23,692 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-08-26 02:10:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 02:10:23,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 02:10:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:23,693 INFO L225 Difference]: With dead ends: 73 [2021-08-26 02:10:23,693 INFO L226 Difference]: Without dead ends: 68 [2021-08-26 02:10:23,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 203.1ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-08-26 02:10:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-26 02:10:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 26. [2021-08-26 02:10:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-08-26 02:10:23,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2021-08-26 02:10:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:23,696 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-26 02:10:23,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2021-08-26 02:10:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 02:10:23,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:23,697 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:23,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 02:10:23,697 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:23,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1760411593, now seen corresponding path program 1 times [2021-08-26 02:10:23,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:23,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300463926] [2021-08-26 02:10:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:23,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:23,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:23,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300463926] [2021-08-26 02:10:23,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300463926] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:23,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332991634] [2021-08-26 02:10:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:23,850 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:23,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:10:23,852 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-08-26 02:10:23,860 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-08-26 02:10:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:23,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-26 02:10:23,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:10:24,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-26 02:10:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:24,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332991634] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:24,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:10:24,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2021-08-26 02:10:24,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446840022] [2021-08-26 02:10:24,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-26 02:10:24,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:24,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-26 02:10:24,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2021-08-26 02:10:24,422 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:25,293 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-08-26 02:10:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-26 02:10:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 02:10:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:25,294 INFO L225 Difference]: With dead ends: 77 [2021-08-26 02:10:25,295 INFO L226 Difference]: Without dead ends: 72 [2021-08-26 02:10:25,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 907.1ms TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2021-08-26 02:10:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-08-26 02:10:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2021-08-26 02:10:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-08-26 02:10:25,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2021-08-26 02:10:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:25,307 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-26 02:10:25,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-08-26 02:10:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 02:10:25,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:25,308 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:25,330 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-08-26 02:10:25,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-26 02:10:25,517 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -949600503, now seen corresponding path program 1 times [2021-08-26 02:10:25,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:25,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21741390] [2021-08-26 02:10:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:25,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:25,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:25,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21741390] [2021-08-26 02:10:25,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21741390] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:25,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044795703] [2021-08-26 02:10:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:25,666 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:25,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:10:25,667 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-08-26 02:10:25,673 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-08-26 02:10:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:25,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-26 02:10:25,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:10:26,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-26 02:10:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:26,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044795703] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:26,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:10:26,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2021-08-26 02:10:26,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933371283] [2021-08-26 02:10:26,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-26 02:10:26,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-26 02:10:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2021-08-26 02:10:26,128 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:27,050 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2021-08-26 02:10:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-26 02:10:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 02:10:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:27,051 INFO L225 Difference]: With dead ends: 81 [2021-08-26 02:10:27,051 INFO L226 Difference]: Without dead ends: 76 [2021-08-26 02:10:27,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 844.3ms TimeCoverageRelationStatistics Valid=347, Invalid=1375, Unknown=0, NotChecked=0, Total=1722 [2021-08-26 02:10:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-26 02:10:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2021-08-26 02:10:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2021-08-26 02:10:27,055 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2021-08-26 02:10:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:27,055 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-08-26 02:10:27,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2021-08-26 02:10:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 02:10:27,056 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:27,056 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:27,079 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-08-26 02:10:27,272 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,SelfDestructingSolverStorable6 [2021-08-26 02:10:27,273 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1048225454, now seen corresponding path program 2 times [2021-08-26 02:10:27,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:27,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862637979] [2021-08-26 02:10:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:27,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:27,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:27,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862637979] [2021-08-26 02:10:27,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862637979] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:27,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164063706] [2021-08-26 02:10:27,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 02:10:27,454 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:10:27,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:10:27,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 02:10:27,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 02:10:27,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 02:10:27,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-26 02:10:27,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:10:28,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-26 02:10:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:28,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164063706] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:28,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:10:28,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2021-08-26 02:10:28,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527253260] [2021-08-26 02:10:28,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-26 02:10:28,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:28,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-26 02:10:28,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2021-08-26 02:10:28,046 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:28,937 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-08-26 02:10:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-26 02:10:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 02:10:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:28,939 INFO L225 Difference]: With dead ends: 85 [2021-08-26 02:10:28,939 INFO L226 Difference]: Without dead ends: 80 [2021-08-26 02:10:28,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 952.2ms TimeCoverageRelationStatistics Valid=438, Invalid=1632, Unknown=0, NotChecked=0, Total=2070 [2021-08-26 02:10:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-26 02:10:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 37. [2021-08-26 02:10:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2021-08-26 02:10:28,943 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2021-08-26 02:10:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:28,944 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2021-08-26 02:10:28,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2021-08-26 02:10:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 02:10:28,944 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:28,944 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:28,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 02:10:29,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:29,153 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash -523217426, now seen corresponding path program 2 times [2021-08-26 02:10:29,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:29,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549038706] [2021-08-26 02:10:29,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:29,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:29,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:29,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549038706] [2021-08-26 02:10:29,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549038706] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:29,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035606941] [2021-08-26 02:10:29,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 02:10:29,296 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:29,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:10:29,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:10:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 02:10:29,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 02:10:29,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 02:10:29,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-26 02:10:29,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:10:29,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-08-26 02:10:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:29,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035606941] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:29,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:10:29,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2021-08-26 02:10:29,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233194254] [2021-08-26 02:10:29,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-26 02:10:29,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-26 02:10:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2021-08-26 02:10:29,711 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:30,682 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2021-08-26 02:10:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-26 02:10:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 02:10:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:30,683 INFO L225 Difference]: With dead ends: 89 [2021-08-26 02:10:30,683 INFO L226 Difference]: Without dead ends: 84 [2021-08-26 02:10:30,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 935.9ms TimeCoverageRelationStatistics Valid=396, Invalid=1496, Unknown=0, NotChecked=0, Total=1892 [2021-08-26 02:10:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-08-26 02:10:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2021-08-26 02:10:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-08-26 02:10:30,687 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2021-08-26 02:10:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:30,687 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-26 02:10:30,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-08-26 02:10:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 02:10:30,688 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:30,688 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:30,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 02:10:30,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:30,893 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash -462854061, now seen corresponding path program 3 times [2021-08-26 02:10:30,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:30,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128226379] [2021-08-26 02:10:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:30,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:31,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:31,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128226379] [2021-08-26 02:10:31,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128226379] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:31,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101200445] [2021-08-26 02:10:31,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 02:10:31,094 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:31,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:10:31,094 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:10:31,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 02:10:31,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 02:10:31,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 02:10:31,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-26 02:10:31,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:10:31,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2021-08-26 02:10:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:10:31,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101200445] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:31,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:10:31,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2021-08-26 02:10:31,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083681031] [2021-08-26 02:10:31,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-26 02:10:31,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-26 02:10:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2021-08-26 02:10:31,875 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:33,714 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-08-26 02:10:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-26 02:10:33,714 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 02:10:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:33,714 INFO L225 Difference]: With dead ends: 89 [2021-08-26 02:10:33,714 INFO L226 Difference]: Without dead ends: 44 [2021-08-26 02:10:33,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1917.9ms TimeCoverageRelationStatistics Valid=796, Invalid=3236, Unknown=0, NotChecked=0, Total=4032 [2021-08-26 02:10:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-08-26 02:10:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2021-08-26 02:10:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-08-26 02:10:33,718 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2021-08-26 02:10:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:33,718 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-26 02:10:33,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-08-26 02:10:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 02:10:33,719 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:10:33,719 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:10:33,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 02:10:33,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-26 02:10:33,933 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:10:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:10:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1209026451, now seen corresponding path program 3 times [2021-08-26 02:10:33,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:10:33,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477875484] [2021-08-26 02:10:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:10:33,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:10:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:10:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:10:34,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:10:34,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477875484] [2021-08-26 02:10:34,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477875484] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:34,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30465851] [2021-08-26 02:10:34,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 02:10:34,114 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:10:34,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:10:34,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 02:10:34,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 02:10:34,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 02:10:34,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 46 conjunts are in the unsatisfiable core [2021-08-26 02:10:34,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:10:34,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2021-08-26 02:10:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:10:34,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30465851] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:10:34,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:10:34,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2021-08-26 02:10:34,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797836994] [2021-08-26 02:10:34,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-26 02:10:34,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:10:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-26 02:10:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2021-08-26 02:10:34,860 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:36,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:10:36,778 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-08-26 02:10:36,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-26 02:10:36,778 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 02:10:36,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:10:36,778 INFO L225 Difference]: With dead ends: 49 [2021-08-26 02:10:36,778 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 02:10:36,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 2025.7ms TimeCoverageRelationStatistics Valid=858, Invalid=3564, Unknown=0, NotChecked=0, Total=4422 [2021-08-26 02:10:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 02:10:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 02:10:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 02:10:36,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-08-26 02:10:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:10:36,779 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 02:10:36,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:10:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 02:10:36,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 02:10:36,781 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:10:36,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 02:10:36,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:10:37,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 02:10:37,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:10:37,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:10:37,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:10:37,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:10:37,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:10:37,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:10:37,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:10:38,676 INFO L853 garLoopResultBuilder]: At program point L44(lines 33 52) the Hoare annotation is: false [2021-08-26 02:10:38,677 INFO L857 garLoopResultBuilder]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2021-08-26 02:10:38,678 INFO L853 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)) (.cse2 (not (= ULTIMATE.start_main_~pd1~0.base 0))) (.cse8 (= ULTIMATE.start_main_~pd2~0.offset 0))) (let ((.cse0 (let ((.cse9 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse9 (= |~#d2~0.offset| 0)) (and .cse9 (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse2 .cse8)))) (.cse1 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse3 (= |~#d1~0.offset| 0)) (.cse4 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse5 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse6 (< ULTIMATE.start_main_~i~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~pa~0.offset 0) .cse4 .cse5 (= ULTIMATE.start_main_~pd1~0.offset 0) .cse6 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|)) (and .cse0 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset) .cse7 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6)))) [2021-08-26 02:10:38,679 INFO L857 garLoopResultBuilder]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2021-08-26 02:10:38,679 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 02:10:38,679 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L24-2(line 24) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L853 garLoopResultBuilder]: At program point L24-3(lines 22 25) the Hoare annotation is: (let ((.cse0 (= |~#d2~0.offset| 0)) (.cse2 (= |~#d1~0.offset| 0)) (.cse1 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (or (and .cse0 (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) (not .cse1) .cse2 (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|)) (and (not (= |~#d1~0.base| |~#d2~0.base|)) .cse0 .cse2 .cse1 (= |ULTIMATE.start_get_dummy_#res.offset| 0)))) [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L24-4(line 24) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L24-6(line 24) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L853 garLoopResultBuilder]: At program point L24-7(lines 22 25) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and (= |~#d2~0.offset| 0) (= |~#d1~0.offset| 0) (or (and .cse0 (= |ULTIMATE.start_get_dummy_#res.offset| ULTIMATE.start_main_~pd1~0.offset) (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|)) (and (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|)) (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|))) (= ULTIMATE.start_main_~pd1~0.offset 0)) (and .cse0 (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|))))) [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L24-8(line 24) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L24-10(line 24) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L853 garLoopResultBuilder]: At program point L24-11(lines 22 25) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse0 (not (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base))) (and (= |~#d2~0.offset| 0) (let ((.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (or (and .cse0 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse1) (and (not .cse1) (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)))) (= |~#d1~0.offset| 0) (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)))) [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L37-2(lines 37 46) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L37-4(lines 37 46) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L853 garLoopResultBuilder]: At program point L29(lines 27 30) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)) (.cse6 (= ULTIMATE.start_main_~pd2~0.offset 0))) (let ((.cse0 (let ((.cse11 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse11 (= |~#d2~0.offset| 0)) (and .cse11 (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse1 (not (= ULTIMATE.start_main_~pd1~0.base 0)) .cse6)))) (.cse2 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse3 (<= (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) ULTIMATE.start_main_~pd2~0.offset) ULTIMATE.start_main_~i~0)) (.cse4 (<= 1 |ULTIMATE.start_check_#res|)) (.cse5 (not (= ULTIMATE.start_main_~pd2~0.base 0))) (.cse7 (= |~#d1~0.offset| 0)) (.cse8 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse9 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse10 (< ULTIMATE.start_main_~i~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset) 1)))) (or (and .cse0 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 (= ULTIMATE.start_main_~pa~0.offset 0) .cse8 .cse9 (= ULTIMATE.start_main_~pd1~0.offset 0) .cse10 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))))) [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L13(lines 13 20) no Hoare annotation was computed. [2021-08-26 02:10:38,680 INFO L860 garLoopResultBuilder]: At program point L51(lines 32 52) the Hoare annotation is: true [2021-08-26 02:10:38,680 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2021-08-26 02:10:38,683 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 02:10:38,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:10:38 BoogieIcfgContainer [2021-08-26 02:10:38,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 02:10:38,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 02:10:38,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 02:10:38,717 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 02:10:38,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:10:21" (3/4) ... [2021-08-26 02:10:38,720 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 02:10:38,727 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-26 02:10:38,727 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 02:10:38,727 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:10:38,727 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:10:38,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((d2 == 0 && \result == d2) && !(d1 == \result)) && d1 == 0) && d2 == \result) || ((((!(d1 == d2) && d2 == 0) && d1 == 0) && d1 == \result) && \result == 0) [2021-08-26 02:10:38,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((d2 == 0 && d1 == 0) && (((!(d1 == d2) && \result == pd1) && pd1 == d1) || ((\result == d2 && !(d1 == \result)) && d2 == \result))) && pd1 == 0) || (!(d1 == d2) && !(pd1 == \result)) [2021-08-26 02:10:38,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(d1 == d2) && d2 == 0) || ((((!(d1 == d2) && d2 == pd1) && pd1 == d2) && !(pd1 == 0)) && pd2 == 0)) && pa == pd2) && pd1 == d2) && pd2 == pa) && unknown-#memory_int-unknown[pd2][pd2] <= i) && 1 <= \result) && !(pd2 == 0)) && pd2 == 0) && d1 == 0) && pd1 == pd2) && pd2 == pd1) && i < unknown-#memory_int-unknown[pa][pa] + 1) || (((((((((((((!(d1 == d2) && d2 == 0) || ((((!(d1 == d2) && d2 == pd1) && pd1 == d2) && !(pd1 == 0)) && pd2 == 0)) && pd2 == pa) && unknown-#memory_int-unknown[pd2][pd2] <= i) && 1 <= \result) && !(pd2 == 0)) && d1 == 0) && pa == 0) && pd1 == pd2) && pd2 == pd1) && pd1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && pd1 == d1) [2021-08-26 02:10:38,751 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 02:10:38,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 02:10:38,753 INFO L168 Benchmark]: Toolchain (without parser) took 17713.32 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 38.1 MB in the beginning and 80.3 MB in the end (delta: -42.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 16.1 GB. [2021-08-26 02:10:38,753 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.0 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:10:38,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.24 ms. Allocated memory is still 58.7 MB. Free memory was 38.0 MB in the beginning and 43.0 MB in the end (delta: -5.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 02:10:38,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.31 ms. Allocated memory is still 58.7 MB. Free memory was 43.0 MB in the beginning and 41.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:10:38,754 INFO L168 Benchmark]: Boogie Preprocessor took 30.26 ms. Allocated memory is still 58.7 MB. Free memory was 41.3 MB in the beginning and 40.0 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:10:38,754 INFO L168 Benchmark]: RCFGBuilder took 400.01 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 39.8 MB in the beginning and 50.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-08-26 02:10:38,754 INFO L168 Benchmark]: TraceAbstraction took 17049.44 ms. Allocated memory was 71.3 MB in the beginning and 182.5 MB in the end (delta: 111.1 MB). Free memory was 49.7 MB in the beginning and 84.4 MB in the end (delta: -34.7 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. [2021-08-26 02:10:38,754 INFO L168 Benchmark]: Witness Printer took 34.61 ms. Allocated memory is still 182.5 MB. Free memory was 84.4 MB in the beginning and 80.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:10:38,756 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.15 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.0 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 148.24 ms. Allocated memory is still 58.7 MB. Free memory was 38.0 MB in the beginning and 43.0 MB in the end (delta: -5.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.31 ms. Allocated memory is still 58.7 MB. Free memory was 43.0 MB in the beginning and 41.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.26 ms. Allocated memory is still 58.7 MB. Free memory was 41.3 MB in the beginning and 40.0 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 400.01 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 39.8 MB in the beginning and 50.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17049.44 ms. Allocated memory was 71.3 MB in the beginning and 182.5 MB in the end (delta: 111.1 MB). Free memory was 49.7 MB in the beginning and 84.4 MB in the end (delta: -34.7 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. * Witness Printer took 34.61 ms. Allocated memory is still 182.5 MB. Free memory was 84.4 MB in the beginning and 80.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16972.4ms, OverallIterations: 11, TraceHistogramMax: 4, EmptinessCheckTime: 16.8ms, AutomataDifference: 8549.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1673.5ms, InitialAbstractionConstructionTime: 7.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 269 SDtfs, 1150 SDslu, 1952 SDs, 0 SdLazy, 3187 SolverSat, 439 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1448.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2623 ImplicationChecksByTransitivity, 8347.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 59.5ms AutomataMinimizationTime, 11 MinimizatonAttempts, 363 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 43 NumberOfFragments, 393 HoareAnnotationTreeSize, 7 FomulaSimplifications, 7028984 FormulaSimplificationTreeSizeReduction, 486.6ms HoareSimplificationTime, 7 FomulaSimplificationsInter, 319761 FormulaSimplificationTreeSizeReductionInter, 1180.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 101.8ms SsaConstructionTime, 311.5ms SatisfiabilityAnalysisTime, 4255.9ms InterpolantComputationTime, 387 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 2662 SizeOfPredicates, 66 NumberOfNonLiveVariables, 896 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 18/80 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((!(d1 == d2) && d2 == 0) || ((((!(d1 == d2) && d2 == pd1) && pd1 == d2) && !(pd1 == 0)) && pd2 == 0)) && pd2 == pa) && !(pd1 == 0)) && d1 == 0) && pa == 0) && pd1 == pd2) && pd2 == pd1) && pd1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && pd1 == d1) || (((((((((((!(d1 == d2) && d2 == 0) || ((((!(d1 == d2) && d2 == pd1) && pd1 == d2) && !(pd1 == 0)) && pd2 == 0)) && pa == pd2) && pd1 == d2) && pd2 == pa) && !(pd1 == 0)) && pd2 == 0) && d1 == 0) && pd1 == pd2) && pd2 == pd1) && i < unknown-#memory_int-unknown[pa][pa] + 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((d2 == 0 && d1 == 0) && (((!(d1 == d2) && \result == pd1) && pd1 == d1) || ((\result == d2 && !(d1 == \result)) && d2 == \result))) && pd1 == 0) || (!(d1 == d2) && !(pd1 == \result)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (!(d1 == d2) && !(pd1 == pd2)) || (((d2 == 0 && (((!(d1 == d2) && d1 == pd1) && pd1 == d1) || ((!(pd1 == d1) && d2 == pd1) && pd1 == d2))) && d1 == 0) && pd2 == pd1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((!(d1 == d2) && d2 == 0) || ((((!(d1 == d2) && d2 == pd1) && pd1 == d2) && !(pd1 == 0)) && pd2 == 0)) && pa == pd2) && pd1 == d2) && pd2 == pa) && unknown-#memory_int-unknown[pd2][pd2] <= i) && 1 <= \result) && !(pd2 == 0)) && pd2 == 0) && d1 == 0) && pd1 == pd2) && pd2 == pd1) && i < unknown-#memory_int-unknown[pa][pa] + 1) || (((((((((((((!(d1 == d2) && d2 == 0) || ((((!(d1 == d2) && d2 == pd1) && pd1 == d2) && !(pd1 == 0)) && pd2 == 0)) && pd2 == pa) && unknown-#memory_int-unknown[pd2][pd2] <= i) && 1 <= \result) && !(pd2 == 0)) && d1 == 0) && pa == 0) && pd1 == pd2) && pd2 == pd1) && pd1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && pd1 == d1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((d2 == 0 && \result == d2) && !(d1 == \result)) && d1 == 0) && d2 == \result) || ((((!(d1 == d2) && d2 == 0) && d1 == 0) && d1 == \result) && \result == 0) RESULT: Ultimate proved your program to be correct! [2021-08-26 02:10:38,788 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...