./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/list-properties/list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:31:27,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:31:27,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:31:27,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:31:27,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:31:27,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:31:27,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:31:27,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:31:27,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:31:27,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:31:27,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:31:27,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:31:27,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:31:27,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:31:27,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:31:27,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:31:27,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:31:27,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:31:27,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:31:27,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:31:27,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:31:27,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:31:27,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:31:27,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:31:27,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:31:27,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:31:27,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:31:27,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:31:27,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:31:27,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:31:27,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:31:27,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:31:27,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:31:27,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:31:27,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:31:27,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:31:27,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:31:27,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:31:27,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:31:27,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:31:27,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:31:27,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:31:27,365 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:31:27,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:31:27,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:31:27,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:31:27,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:31:27,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:31:27,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:31:27,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:31:27,367 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:31:27,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:31:27,368 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:31:27,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:31:27,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:31:27,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:31:27,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:31:27,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:31:27,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:31:27,369 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:31:27,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:31:27,370 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:31:27,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:31:27,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:31:27,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:31:27,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:31:27,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:31:27,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:31:27,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:31:27,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:31:27,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:31:27,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:31:27,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:31:27,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:31:27,372 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:31:27,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:31:27,372 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:31:27,372 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 [2023-02-15 10:31:27,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:31:27,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:31:27,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:31:27,570 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:31:27,570 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:31:27,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-2.i [2023-02-15 10:31:28,605 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:31:28,819 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:31:28,821 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2023-02-15 10:31:28,835 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc529f57/ab7f4586fb4a4815a799f12a599e530a/FLAG7d4432ebb [2023-02-15 10:31:28,849 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc529f57/ab7f4586fb4a4815a799f12a599e530a [2023-02-15 10:31:28,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:31:28,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:31:28,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:31:28,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:31:28,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:31:28,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:28" (1/1) ... [2023-02-15 10:31:28,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baef9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:28, skipping insertion in model container [2023-02-15 10:31:28,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:28" (1/1) ... [2023-02-15 10:31:28,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:31:28,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:31:29,079 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2023-02-15 10:31:29,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:31:29,094 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:31:29,123 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2023-02-15 10:31:29,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:31:29,155 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:31:29,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29 WrapperNode [2023-02-15 10:31:29,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:31:29,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:31:29,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:31:29,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:31:29,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,191 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-02-15 10:31:29,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:31:29,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:31:29,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:31:29,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:31:29,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,213 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:31:29,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:31:29,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:31:29,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:31:29,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (1/1) ... [2023-02-15 10:31:29,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:31:29,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:29,245 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) [2023-02-15 10:31:29,251 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 [2023-02-15 10:31:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 10:31:29,269 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 10:31:29,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:31:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:31:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:31:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:31:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:31:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:31:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:31:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:31:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:31:29,359 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:31:29,361 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:31:29,392 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 10:31:29,512 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:31:29,516 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:31:29,517 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 10:31:29,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:29 BoogieIcfgContainer [2023-02-15 10:31:29,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:31:29,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:31:29,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:31:29,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:31:29,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:31:28" (1/3) ... [2023-02-15 10:31:29,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b299f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:29, skipping insertion in model container [2023-02-15 10:31:29,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:29" (2/3) ... [2023-02-15 10:31:29,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b299f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:29, skipping insertion in model container [2023-02-15 10:31:29,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:29" (3/3) ... [2023-02-15 10:31:29,524 INFO L112 eAbstractionObserver]: Analyzing ICFG list-2.i [2023-02-15 10:31:29,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:31:29,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:31:29,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:31:29,577 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65a5a531, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:31:29,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:31:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 10:31:29,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:29,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:29,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2023-02-15 10:31:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:29,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813941986] [2023-02-15 10:31:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:29,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813941986] [2023-02-15 10:31:29,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813941986] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:29,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:29,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:31:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65335167] [2023-02-15 10:31:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:29,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:31:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:31:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:31:29,789 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-15 10:31:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:29,808 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2023-02-15 10:31:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:31:29,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-02-15 10:31:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:29,815 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:31:29,815 INFO L226 Difference]: Without dead ends: 21 [2023-02-15 10:31:29,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:31:29,819 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:29,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-15 10:31:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-15 10:31:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2023-02-15 10:31:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-15 10:31:29,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2023-02-15 10:31:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:29,844 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-15 10:31:29,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-15 10:31:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-15 10:31:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:31:29,845 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:29,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:29,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:31:29,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2023-02-15 10:31:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:29,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182109051] [2023-02-15 10:31:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182109051] [2023-02-15 10:31:30,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182109051] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:30,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:30,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075655975] [2023-02-15 10:31:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:30,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:30,105 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-02-15 10:31:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:30,207 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-02-15 10:31:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2023-02-15 10:31:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:30,210 INFO L225 Difference]: With dead ends: 46 [2023-02-15 10:31:30,210 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 10:31:30,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:31:30,215 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:30,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 10:31:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2023-02-15 10:31:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 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) [2023-02-15 10:31:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-15 10:31:30,222 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2023-02-15 10:31:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:30,222 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-15 10:31:30,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-02-15 10:31:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-15 10:31:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:31:30,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:30,223 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:30,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:31:30,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2023-02-15 10:31:30,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:30,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82413753] [2023-02-15 10:31:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:30,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:30,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:30,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82413753] [2023-02-15 10:31:30,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82413753] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:30,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:30,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:30,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025095787] [2023-02-15 10:31:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:30,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:30,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:30,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:30,308 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 10:31:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:30,384 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-02-15 10:31:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:30,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-15 10:31:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:30,386 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:31:30,387 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:31:30,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:31:30,388 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:30,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:31:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2023-02-15 10:31:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2023-02-15 10:31:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-02-15 10:31:30,392 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2023-02-15 10:31:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:30,393 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-02-15 10:31:30,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 10:31:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-02-15 10:31:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:31:30,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:30,394 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:30,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:31:30,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2023-02-15 10:31:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:30,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723459105] [2023-02-15 10:31:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:30,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:30,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723459105] [2023-02-15 10:31:30,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723459105] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:30,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:30,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823981258] [2023-02-15 10:31:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:30,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:30,524 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 10:31:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:30,583 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-02-15 10:31:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-15 10:31:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:30,585 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:31:30,585 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 10:31:30,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:31:30,591 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:30,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 10:31:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2023-02-15 10:31:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2023-02-15 10:31:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-02-15 10:31:30,599 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2023-02-15 10:31:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:30,600 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-02-15 10:31:30,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 10:31:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-02-15 10:31:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:31:30,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:30,601 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:30,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:31:30,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2023-02-15 10:31:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:30,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878142141] [2023-02-15 10:31:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:30,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:30,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878142141] [2023-02-15 10:31:30,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878142141] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:30,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371607112] [2023-02-15 10:31:30,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:30,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:30,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:30,835 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) [2023-02-15 10:31:30,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:31:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:30,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 10:31:30,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:30,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:30,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:30,990 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:30,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:31,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:31,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 10:31:31,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 14 treesize of output 16 [2023-02-15 10:31:31,068 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 10:31:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:31,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:31,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:31,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-15 10:31:31,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:31,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-02-15 10:31:31,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-02-15 10:31:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:31,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371607112] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:31,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:31,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-02-15 10:31:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465549408] [2023-02-15 10:31:31,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:31,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:31:31,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:31:31,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=211, Unknown=8, NotChecked=0, Total=272 [2023-02-15 10:31:31,226 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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) [2023-02-15 10:31:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:31,428 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-02-15 10:31:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:31:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 [2023-02-15 10:31:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:31,429 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:31:31,429 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 10:31:31,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=343, Unknown=9, NotChecked=0, Total=462 [2023-02-15 10:31:31,429 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 114 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:31,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 76 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 10:31:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2023-02-15 10:31:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 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) [2023-02-15 10:31:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-15 10:31:31,433 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2023-02-15 10:31:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:31,433 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-15 10:31:31,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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) [2023-02-15 10:31:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-15 10:31:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:31:31,434 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:31,434 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:31,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:31,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:31,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2023-02-15 10:31:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:31,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665396609] [2023-02-15 10:31:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:31,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:31,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665396609] [2023-02-15 10:31:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665396609] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052870386] [2023-02-15 10:31:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:31,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:31,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:31,871 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) [2023-02-15 10:31:31,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:31:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:31,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 10:31:31,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:31,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:31,967 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:31,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:31,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:32,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:32,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 10:31:32,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 14 treesize of output 16 [2023-02-15 10:31:32,050 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 10:31:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:32,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:32,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:32,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-15 10:31:32,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:32,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-02-15 10:31:32,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-02-15 10:31:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:32,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052870386] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:32,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:32,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-02-15 10:31:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592409016] [2023-02-15 10:31:32,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:32,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:31:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:31:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=216, Unknown=3, NotChecked=0, Total=272 [2023-02-15 10:31:32,174 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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) [2023-02-15 10:31:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:32,396 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-15 10:31:32,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:31:32,396 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 [2023-02-15 10:31:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:32,397 INFO L225 Difference]: With dead ends: 44 [2023-02-15 10:31:32,397 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:31:32,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=316, Unknown=3, NotChecked=0, Total=420 [2023-02-15 10:31:32,397 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:32,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 101 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:31:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-02-15 10:31:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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) [2023-02-15 10:31:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-02-15 10:31:32,401 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2023-02-15 10:31:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:32,401 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-02-15 10:31:32,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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) [2023-02-15 10:31:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-02-15 10:31:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:31:32,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:32,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:32,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:32,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 10:31:32,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 242294851, now seen corresponding path program 1 times [2023-02-15 10:31:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:32,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825740754] [2023-02-15 10:31:32,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:32,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:32,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:32,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825740754] [2023-02-15 10:31:32,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825740754] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:32,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015354424] [2023-02-15 10:31:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:32,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:32,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:32,842 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) [2023-02-15 10:31:32,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:31:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:32,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 10:31:32,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:32,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:32,942 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:32,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:32,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:32,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:32,982 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:32,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-02-15 10:31:32,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 36 [2023-02-15 10:31:32,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 10:31:33,007 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 19 [2023-02-15 10:31:33,009 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 10:31:33,017 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 10:31:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:33,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:33,037 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 57 [2023-02-15 10:31:33,045 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_189 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_186 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-02-15 10:31:33,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:33,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:31:33,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:33,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 10:31:33,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-15 10:31:33,076 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:33,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 10:31:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 10:31:33,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015354424] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:33,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:33,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-02-15 10:31:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319208263] [2023-02-15 10:31:33,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:33,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 10:31:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 10:31:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2023-02-15 10:31:33,146 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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) [2023-02-15 10:31:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:33,326 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2023-02-15 10:31:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:31:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 [2023-02-15 10:31:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:33,326 INFO L225 Difference]: With dead ends: 68 [2023-02-15 10:31:33,327 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 10:31:33,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=271, Unknown=1, NotChecked=34, Total=380 [2023-02-15 10:31:33,327 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:33,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 104 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 172 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2023-02-15 10:31:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 10:31:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2023-02-15 10:31:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 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) [2023-02-15 10:31:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-02-15 10:31:33,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2023-02-15 10:31:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:33,332 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-02-15 10:31:33,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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) [2023-02-15 10:31:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-02-15 10:31:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:31:33,337 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:33,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:33,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:33,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:33,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:33,543 INFO L85 PathProgramCache]: Analyzing trace with hash 965794270, now seen corresponding path program 1 times [2023-02-15 10:31:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:33,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239961928] [2023-02-15 10:31:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:33,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:33,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239961928] [2023-02-15 10:31:33,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239961928] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090239204] [2023-02-15 10:31:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:33,799 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) [2023-02-15 10:31:33,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:31:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:33,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 10:31:33,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:33,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:33,920 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:33,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:33,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:33,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:33,966 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:33,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-02-15 10:31:33,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 10:31:33,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2023-02-15 10:31:34,002 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 19 [2023-02-15 10:31:34,005 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 10:31:34,011 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 10:31:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:34,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:34,043 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 30 [2023-02-15 10:31:34,048 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_240 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_242 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-02-15 10:31:34,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:34,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:31:34,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:34,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-02-15 10:31:34,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-02-15 10:31:34,081 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:34,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 10:31:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 10:31:34,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090239204] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:34,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:34,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-02-15 10:31:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540682043] [2023-02-15 10:31:34,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:34,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:31:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:34,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:31:34,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2023-02-15 10:31:34,180 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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) [2023-02-15 10:31:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:34,369 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2023-02-15 10:31:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:31:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 [2023-02-15 10:31:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:34,370 INFO L225 Difference]: With dead ends: 70 [2023-02-15 10:31:34,370 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 10:31:34,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=444, Unknown=1, NotChecked=44, Total=600 [2023-02-15 10:31:34,371 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:34,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 129 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 193 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2023-02-15 10:31:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 10:31:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2023-02-15 10:31:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 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) [2023-02-15 10:31:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-15 10:31:34,375 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 24 [2023-02-15 10:31:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:34,375 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-15 10:31:34,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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) [2023-02-15 10:31:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-15 10:31:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:31:34,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:34,375 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:34,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:34,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:34,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 2 times [2023-02-15 10:31:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:34,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450878179] [2023-02-15 10:31:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450878179] [2023-02-15 10:31:34,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450878179] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286454933] [2023-02-15 10:31:34,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:31:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:34,778 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) [2023-02-15 10:31:34,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:31:34,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:31:34,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:31:34,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 10:31:34,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:34,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:34,880 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:34,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:34,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:31:34,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:31:34,935 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:34,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2023-02-15 10:31:34,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-02-15 10:31:34,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 34 [2023-02-15 10:31:34,981 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 21 [2023-02-15 10:31:34,984 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-02-15 10:31:34,987 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 10:31:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:34,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:35,025 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 30 [2023-02-15 10:31:35,029 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_293 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-02-15 10:31:35,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:35,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:31:35,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:35,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-02-15 10:31:35,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-02-15 10:31:35,059 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:35,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 10:31:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 10:31:35,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286454933] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:35,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:35,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-02-15 10:31:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582046351] [2023-02-15 10:31:35,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:35,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:31:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:31:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2023-02-15 10:31:35,126 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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) [2023-02-15 10:31:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:35,336 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2023-02-15 10:31:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:31:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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 [2023-02-15 10:31:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:35,337 INFO L225 Difference]: With dead ends: 65 [2023-02-15 10:31:35,337 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 10:31:35,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=566, Unknown=1, NotChecked=50, Total=756 [2023-02-15 10:31:35,338 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 61 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:35,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 120 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 170 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2023-02-15 10:31:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 10:31:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2023-02-15 10:31:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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) [2023-02-15 10:31:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-02-15 10:31:35,342 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 24 [2023-02-15 10:31:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:35,342 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-02-15 10:31:35,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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) [2023-02-15 10:31:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-02-15 10:31:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:31:35,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:35,343 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:35,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:35,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:35,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1042173034, now seen corresponding path program 3 times [2023-02-15 10:31:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:35,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146637776] [2023-02-15 10:31:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:36,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146637776] [2023-02-15 10:31:36,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146637776] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:36,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146889576] [2023-02-15 10:31:36,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:31:36,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:36,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:36,036 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) [2023-02-15 10:31:36,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:31:36,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:31:36,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:31:36,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-15 10:31:36,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:36,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:36,160 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:31:36,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 10:31:36,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:36,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:36,257 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:36,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 10:31:36,271 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 10:31:36,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 10:31:36,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:36,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 10:31:36,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:36,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:36,382 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 10:31:36,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 103 [2023-02-15 10:31:36,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:36,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-02-15 10:31:36,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 96 [2023-02-15 10:31:36,502 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 10:31:36,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 87 [2023-02-15 10:31:36,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2023-02-15 10:31:36,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:36,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2023-02-15 10:31:36,584 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:36,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 40 [2023-02-15 10:31:36,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 10:31:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:36,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:36,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:36,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 149 [2023-02-15 10:31:36,964 INFO L350 Elim1Store]: Elim1 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 2605 treesize of output 2441 [2023-02-15 10:31:36,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:36,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2441 treesize of output 2199 [2023-02-15 10:31:45,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-02-15 10:31:45,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 37 [2023-02-15 10:31:45,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 10:31:45,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-15 10:31:45,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-02-15 10:31:45,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 101 [2023-02-15 10:31:45,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 117 [2023-02-15 10:31:45,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2023-02-15 10:31:45,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 42 [2023-02-15 10:31:45,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 42 [2023-02-15 10:31:46,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-02-15 10:31:46,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2023-02-15 10:31:46,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:46,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2023-02-15 10:31:46,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2023-02-15 10:31:46,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:46,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-02-15 10:31:46,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 48 [2023-02-15 10:31:46,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-02-15 10:31:46,149 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:46,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-02-15 10:31:46,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-02-15 10:31:46,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2023-02-15 10:31:46,182 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:46,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2023-02-15 10:31:46,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 37 [2023-02-15 10:31:46,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 10:31:46,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 10:31:46,255 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:46,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 10:31:46,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-02-15 10:31:46,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:46,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 10:31:46,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 10:31:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:46,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146889576] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:46,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:46,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 30 [2023-02-15 10:31:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280512170] [2023-02-15 10:31:46,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:46,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 10:31:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 10:31:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=757, Unknown=6, NotChecked=0, Total=870 [2023-02-15 10:31:46,670 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 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) [2023-02-15 10:31:46,759 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_383 Int) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse1 (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_383)))) (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= 3 .cse1) (= 2 .cse1)))) (= .cse5 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse5 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select |c_#valid| .cse0) 1))) is different from false [2023-02-15 10:31:49,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:31:51,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:31:51,304 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= 2 .cse0) (= 3 .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-15 10:31:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:52,604 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2023-02-15 10:31:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 10:31:52,604 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 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 [2023-02-15 10:31:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:52,604 INFO L225 Difference]: With dead ends: 88 [2023-02-15 10:31:52,605 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 10:31:52,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=257, Invalid=1628, Unknown=15, NotChecked=170, Total=2070 [2023-02-15 10:31:52,606 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 25 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:52,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 247 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 486 Invalid, 25 Unknown, 20 Unchecked, 4.7s Time] [2023-02-15 10:31:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 10:31:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2023-02-15 10:31:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 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) [2023-02-15 10:31:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-02-15 10:31:52,614 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 26 [2023-02-15 10:31:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:52,615 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-02-15 10:31:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 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) [2023-02-15 10:31:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-02-15 10:31:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:31:52,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:52,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:52,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:52,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:52,820 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash 268237098, now seen corresponding path program 1 times [2023-02-15 10:31:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:52,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127494266] [2023-02-15 10:31:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:31:52,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 10:31:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:31:52,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 10:31:52,853 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 10:31:52,854 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:31:52,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 10:31:52,858 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:52,860 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:31:52,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:31:52 BoogieIcfgContainer [2023-02-15 10:31:52,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:31:52,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:31:52,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:31:52,892 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:31:52,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:29" (3/4) ... [2023-02-15 10:31:52,894 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 10:31:52,931 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:31:52,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:31:52,931 INFO L158 Benchmark]: Toolchain (without parser) took 24079.67ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 137.1MB in the beginning and 160.1MB in the end (delta: -22.9MB). Peak memory consumption was 127.8MB. Max. memory is 16.1GB. [2023-02-15 10:31:52,932 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:31:52,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.98ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 120.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 10:31:52,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.47ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:31:52,933 INFO L158 Benchmark]: Boogie Preprocessor took 27.62ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 117.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:31:52,933 INFO L158 Benchmark]: RCFGBuilder took 297.30ms. Allocated memory is still 184.5MB. Free memory was 117.0MB in the beginning and 103.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 10:31:52,933 INFO L158 Benchmark]: TraceAbstraction took 23371.62ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 102.8MB in the beginning and 162.2MB in the end (delta: -59.4MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2023-02-15 10:31:52,933 INFO L158 Benchmark]: Witness Printer took 39.39ms. Allocated memory is still 333.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:31:52,935 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.15ms. Allocated memory is still 121.6MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.98ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 120.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.47ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.62ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 117.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.30ms. Allocated memory is still 184.5MB. Free memory was 117.0MB in the beginning and 103.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23371.62ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 102.8MB in the beginning and 162.2MB in the end (delta: -59.4MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 39.39ms. Allocated memory is still 333.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [a={-1:0}, p={-1:0}, t={-3:0}] [L552] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n [L554] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L556] COND TRUE p->h != 3 [L557] reach_error() VAL [a={-1:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 459 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 976 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 129 IncrementalHoareTripleChecker+Unchecked, 799 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1472 IncrementalHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 177 mSDtfsCounter, 1472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 165 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=10, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 450 ConstructedInterpolants, 56 QuantifiedInterpolants, 6601 SizeOfPredicates, 63 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 22/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 10:31:52,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE